Strong Colorings of Hypergraphs

Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. We then consider various parameters that make coloring easier, and give a unified treatment. In particular, we give an algebraic scheme using integer programming to color graphs of bounded composition-width.

• Type: Conference
• Year: 2004
• Where: WAOA
• Authors: Geir Agnarsson, Magnús M. Halldórsson
• Keywords: Distinct Colors, Graph Coloring Problems, Strong Vertex Coloring, WAOA 2004