Description
Book SynopsisThe theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.
Table of ContentsIntroduction The lower chromatic number of a hypergraph Mixed hypergraphs and the upper chromatic number Uncolorable mixed hypergraphs Uniquely colorable mixed hypergraphs $\mathcal{C}$-perfect mixed hypergraphs Gaps in the chromatic spectrum Interval mixed hypergraphs Pseudo-chordal mixed hypergraphs Circular mixed hypergraphs Planar mixed hypergraphs Coloring block designs as mixed hypergraphs Modelling with mixed hypergraphs Bibliography List of figures Index.