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

**References**

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

© 1996-9

1999-05-26