zbMATH — the first resource for mathematics

Restricted colorings of graphs. (English) Zbl 0791.05034
Walker, Keith (ed.), Surveys in combinatorics, 1993. Papers of the fourteenth British combinatorial conference held at Keele, United Kingdom, July 1993. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 187, 1-33 (1993).
Summary: The problem of properly coloring the vertices (or edges) of a graph using for each vertex (or edge) a color from a prescribed list of permissible colors, received a considerable amount of attention. Here we describe the techniques applied in the study of this subject, which combine combinatorial, algebraic and probabilistic methods, and discuss several intriguing conjectures and open problems. This is mainly a survey of recent and less recent results in the area, but it contains several new results as well.
For the entire collection see [Zbl 0778.00039].

05C15 Coloring of graphs and hypergraphs