A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type
of vertex coloring seeks to minimize the number of colors for a given graph. Such
a coloring is known as a minimum vertex coloring,
and the minimum number of colors which with the vertices of a graph may be colored is called the chromatic
number, denoted .

Christofides, N. "An Algorithm for the Chromatic Number of a Graph." Computer J.14, 38-39, 1971.Gould, R.
(Ed.). Graph
Theory. Menlo Park, CA: Benjamin-Cummings, 1988.Manvel, B. "Extremely
Greedy Coloring Algorithms." In Graphs
and Applications (Ed. F. Harary and J. Maybee). New York: Wiley,
pp. 257-270, 1985.Matula D. W.; Marble, G.; and Isaacson,
J. D. "Graph Coloring Algorithms." In Graph
Theory and Computing (Ed. R. Read). New York: Academic Press, pp. 109-122,
1972.Skiena, S. "Finding a Vertex Coloring." §5.5.3 in
Implementing
Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading,
MA: Addison-Wesley, pp. 214-215, 1990.Thomassen, C. "The Number
of -Colorings
of a Graph on a Fixed Surface." Disc. Math.306, 3145-3153, 2006.Wilf,
H. "Backtrack: An
Expected Time Algorithm for the Graph Coloring Problem." Info. Proc. Let.18,
119-121, 1984.