1) 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时,称为均匀全染色,其所用最少染色数称为均匀全色数。
2) 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-着色的一个充分必要条件和均匀色数表达式。
3) adjacent vertex-distinguishing-equitable total chromatic number
邻点可区别均匀全色数
1.
We studied adjacent vertex-distinguishing-equitable total coloring(AVDETC) of some double graphs,and developed the adjacent vertex-distinguishing-equitable total chromatic numbers of double graphs of even order complete graph,even order cycle,path,star and wheel using constructive method and matching method,which satisfies the conjecture on AVDETCC.
研究一些倍图的邻点可区别均匀全染色(AVDETC),利用构造法和匹配法给出了偶阶完全图、偶阶圈、路、星和轮的倍图的邻点可区别均匀全色数,并验证了它们满足邻点可区别均匀全染色猜想(AVDETCC)。
4) Equitable total coloring
均匀全染色
1.
The equitable total coloring of a graph G is the proper total coloring such that the numbers of elements in any two color classes differ by at most one.
如果G的一个正常全染色满足任意两种颜色所染元素数目相差不超过1,则称为G的均匀全染色,其所用最少染色数称为G的均匀全色数。
2.
In this paper,graphs are classified according to equitable total chromatic number,have proved theorems of equitable total coloring of graph and got equitable total chromatic number of some Join-graphs.
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数。
3.
Let G(V,E) be a simple graph,f be a kproper total coloring of G,if f satisfing ||Vi∪Ei|-|Vj∪Ej||≤1 (i≠j),there Vi∪Ei={v|f(v)=i}∪{e|e∈E(G),f(e)=i},then f is called k-equitable total coloring of G(in brief,it is noted as k-ETC).
设G(V,E)是一个简单图,f是G的一个k-正常全染色,若f满足||Vi∪Ei|-|Vj∪Ej||≤1(i≠j),其中Vi∪Ei={v|f(v)=i}∪{e|f(e)=i},则称f为G的k-均匀全染色,简记为k-ETC。
5) 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的均匀全着色
6) 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)。
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条