Coloring mixed hypergraphs: theory, algorithms and applications (Q1613673): Difference between revisions

This book presents a comprehensive survey of coloring hypergraphs. The author examines the standard definition of coloring hypergraphs: a color is assigned to each vertex so that no hyperedge is monochromatic. He also examines anti-edges, which are required to have at least two vertices with the same color (i.e., they cannot be polychromatic). These are also known as co-edges, although the author argues against this terminology. The mixed hypergraphs of the title contain both regular edges and anti-edges. Such a mixed hypergraph may not be properly colorable under the given restrictions, which complicates algorithmic implications. The material is organized as follows from the table of contents: Introduction. (I) The lower chromatic number of a hypergraph. (II) Mixed hypergraphs and the upper chromatic number. (III) Uncolorable mixed hypergraphs. (IV) Uniquely colorable mixed hypergraphs. (V) \({\mathcal C}\)-perfect mixed hypergraphs. (VI) Gaps in the chromatic spectrum. (VII) Interval mixed hypergraphs. (VIII) Pseudo-chordal mixed hypergraphs. (IX) Circular mixed hypergraphs. (X) Planar mixed hypergraphs. (XI) Coloring block designs on mixed hypergraphs. (XII) Modelling with mixed hypergraphs. The book should be of interest to those studying colorings of hypergraphs and is recommended.