A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Graph colorings with local constraints -- a survey

1997
*
Discussiones Mathematicae Graph Theory
*

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 c v for the vertices v ∈ V are given, and the question is

doi:10.7151/dmgt.1049
fatcat:du2wuuygubedxp5jzztrmw5ike