chromatic number

短语

[计] 色数, 颜色种数

词形变化

chromatic numbers 复数 chromatic numbers

释义与例句

n.
  1. 1.

    The smallest number of colours needed to colour a given graph (i.e., to assign a colour to each vertex such that no two vertices connected by an edge have the same colour).

    数学

    The chromatic number of a complete graph K#95;n is n; the chromatic number of a bipartite graph K#95;#123;n,m#125; is 2.

    2009, Gary Chartrand, Ping Zhang, Chromatic Graph Theory, Taylor & Francis Group (CRC Press / Chapman & Hall), page 149, There is no general formula for the chromatic number of a graph. Consequently, we will often be concerned and must be content with (1) determining the chromatic number of some classes of interest and (2) determining upper and/or lower bounds for the chromatic number of a graph.