chromatic number

English

Noun

chromatic number (plural chromatic numbers)

(graph theory) The smallest number of colours needed to colour a connected graph
The chromatic number of a complete graph $K_n$ is $n$ and the chromatic number of the bipartite graph $K_{n,m}$ two.

Translations

smallest number of colours

Hungarian: kromatikus szám (hu)
Icelandic: litatala (is) f

Spanish: número cromático (es) m

Read in another language

This page is available in 2 languages

Last modified on 18 June 2013, at 17:00