## 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.

*Eric Weisstein's World Of Mathematics*.

Last updated: 2000-03-18

Loading

Tweet