chromatic number

EnglishEdit

NounEdit

chromatic number (plural chromatic numbers)

  1. (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.

TranslationsEdit

Last modified on 7 October 2013, at 23:06