chromatic number mathematics
The smallest number of colours necessary to colour the nodes of a graph so that no two adjacent nodes have the same colour.
See also: four colour map theorem.
Graph Theory Lessons.
Eric Weisstein's World Of Mathematics.
The Geometry Center.
(2000-03-18)