1) 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-着色的一个充分必要条件和均匀色数表达式。
2) Equitable total chromatic number
均匀全色数
1.
On the equitable total chromatic number of P_n∨K_(m,n);
图P_n∨K_(m,n)的均匀全色数
2.
On the equitable total chromatic number of P_m∨F_n;
图岛P_m∨F_n的均匀全色数
3.
In this paper,we have given the equitable total chromatic number of C_m∨S_n.
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数。
3) 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)。
4) equitable adjacent strong edge chromatic number
均匀邻强边色数
1.
χ~(′)_(eas)(G)=min{k|k-EASEC of G} be called the equitable adjacent strong edge chromatic number of G.
并称χe′as(G)=min{k k-EASEC of G}为G的均匀邻强边色数。
5) equitable coloring
均匀染色
1.
Neural network model of equitable coloring of graphs;
图的均匀染色问题的神经网络模型
2.
Equitable coloring of graphs extends the theory about coloring graphs.
图的均匀染色理论是图的染色理论的一种推广，但到目前为止，关于这一理论的很多问题还有待解决。
6) equitable coloring
均匀着色
补充资料：色数儿
1.即色子。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条