1) equitable chromatic number
均匀着色数
1.
This paper studied equitable chromatic numbers of several product graphs and proved the graphs are equitably k-colorable where k≥2 or 3.
考虑了几类乘积图的均匀着色数,证明了这几类乘积图可均匀k-着色(k≥2或3)。
2) equitable coloring
均匀着色
3) Equitable Total Coloring
均匀全着色
1.
Equitable Total Coloring of C_m□C_n and P_m□C_n;
C_m□C_n和P_m□C_n的均匀全着色
4) spotty staining
不均匀着色
5) Equitable chromatic number
均匀色数
1.
In this paper,some conditions for which trees are equitably k-colorable are determined;a sufficient and necessary condition and an explicit formula for the equitable chromatic number of trees with diameter 4 are given.
本文得到树可均匀k-着色的一些条件;直径为4的树可均匀k-着色的一个充分必要条件和均匀色数表达式。
6) Equitably k-colorable
可均匀k-着色
1.
A graph is equitably k-colorable if its vertices can be partitioned into k-independent sets of as near equal sizes as possible.
称图G是可均匀k-着色的,如果可以用k种颜色给G的顶点着色,使得相邻的顶点不同色且各色类的基数至多差1。
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条