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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Agnarsson, G., & Halldórsson, M. M. (2005). Strong colorings of hypergraphs. In Lecture Notes in Computer Science (Vol. 3351, pp. 253–266). Springer Verlag. https://doi.org/10.1007/978-3-540-31833-0_21
Mendeley helps you to discover research relevant for your work.