info prev up next book cdrom email home


A $k$-coloring of a Graph $G$ is an assignment of one of $k$ possible colors to each vertex of $G$ such that no two adjacent vertices receive the same color.

See also Coloring, Edge-Coloring


Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.

© 1996-9 Eric W. Weisstein