Sciweavers

Share
WAOA
2004
Springer

Strong Colorings of Hypergraphs

11 years 6 months ago
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.
Geir Agnarsson, Magnús M. Halldórsso
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where WAOA
Authors Geir Agnarsson, Magnús M. Halldórsson
Comments (0)
books