Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

chromatic number

You are here: irt.org | FOLDOC | 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 (http://utc.edu/~cpmawata/petersen/lesson8.htm).

Eric Weisstein's World Of Mathematics (http://mathworld.wolfram.com/ChromaticNumber.html).

The Geometry Center (http://geom.umn.edu/~zarembe/grapht1.html).


Nearby terms: Christmas tree « Christmas tree packet « Christopher Strachey « chromatic number » chrome » chroot » CHRP

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb