# chromatic number

## chromatic number

[krō′mad·ik ′nəm·bər] (mathematics)

For a specified surface, the smallest number

*n*such that for any decomposition of the surface into regions the regions can be colored with*n*colors in such a way that no two adjacent regions have the same color.## 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.

See also: four colour map theorem.

**Graph Theory Lessons**.**Eric Weisstein's World Of Mathematics**.**The Geometry Center**.Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: