Geometric algorithms and combinatorial optimization [Book]
Graph colorings with local constraints - a survey
We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precoloring extensions are considered. In one of the most general formulations, a graph G = (V,E), sets L(v) of admissible colors, and natural numbers for the vertices v ∈ V are given, and the question is whether...
Graph factorization, general triple systems, and cyclic triple systems.