1) L(2,1)-labelling number
标号着色数
2) local chromatic number
着色函数
3) coloring number
着色数
1.
The coloring number of the graph which is triangle free and can be embedded on the Klein bottle or the torus is no more than 4.
任何一个嵌入到Klein瓶上或环面上的图 ,若无三角形其着色数最多是 4 。
4) chromatic number
着色数
1.
Star chromatic number, introduced by A.
Vince定义的星着色数推广了一般的着色数的定义 。
2.
The adjacent strong chromatic number of a graph C, denoted by x as(G),is the least number of colors required for an adjacent strong edge coloring of G.
对图G进行相邻强边着色所需要的最小色数称为G的相邻强边着色数,记作X'as(G)。
3.
Abstract Combined with the edge-connectivity of graphs, this paper gives an upperbound of Betti deficiency on a graph in terms of chromatic number of its complement, provesthat this bound is the best possible, and obtains some new results on the lower bounds of themaximum genus of graphs.
结合边连通性,本文给出了一个图的Ｂｅｔｔｉ亏数由这个图的补图的着色数所确定的上界式,证明了所给出的上界式是最好的,得到关于图的最大亏格下界的若干新结果。
5) Fractional coloring
分数着色
6) Coloration index
着色指数
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条