chromatic number
名词 n.
英文释义
名词 n.
-
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.
词形变化
0 次浏览
数据来源: Wiktionary