1) fractional total chromatic number
分数全色数
1.
The fractional total chromatic number of some special graphs;
几类特殊图的分数全色数
2) fractional total coloring
分数全染色
3) fractional chromatic number
分数色数
1.
Girth and fractional chromatic number of seriel parallel graphs;
系列平行图的围长和分数色数
2.
Girth and fractional chromatic number of outer planar graphs;
外平面图的围长和分数色数
3.
The fractional chromatic number of the distance graph G(Z,Dm,k,k+1,k+2,k+3)(where Dm,k,k+1,k+2,k+3={1,2,…,m}-{k,k+1,k+2,k+3}) and its chromatic number for some pairs of integers,when 2k≤m≤2k+5 were discussed.
主要讨论了距离图G(Z,Dm,k,k+1,k+2,k+3)(其中Dm,k,k+1,k+2,k+3={1,2,…,m}-{k,k+1,k+2,k+3})的分数色数,以及当2k≤m≤2k+5时G(Z,Dm,k,k+1,k+2,k+3)的色数。
4) total chromatic number
全色数
1.
The total chromatic number of general graphs K(n,m);
广义图K(n,m)的全色数(英文)
2.
Let G be a simple graph,k is a positive integer and f is a mapping form V(G)∪E(G) to {1,2,…,k},if for any uv∈E(G),there are f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv);for any uv,vw∈E(G),u≠w,there is f(uv)≠f(uw),then f is called a k-proper total coloring of G(k-TC in brief),and the number ΧT(G)=min{k|G存在k-TC} is called the total chromatic number of G.
设G是一个简单图,k为正整数,V(G)∪E(G)到{1,2,…,k}的一个映射f满足:对于任意的uv∈E(G)有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv);任意的uv,vw∈E(G),u≠w,有f(uv)≠f(uw),则称f为G的k-全染色,简记为k-TC,并称ΧT(G)=min{k|G存在k-TC}为G的全色数。
5) total chromatic number
全染色数
1.
Then the total chromatic number of G is Δ(G)+1 if(Δ,k)∈{(6,4),(5,5),(4,11)}.
本文对3-圈不重点的,且不含从4到k圈的平面图,得出的结论有:如果(Δ,k)分别是(6,4),(5,5),(4,11),则G的全染色数是Δ(G)+1。
2.
The total chromatic number x1(G) is the smallest interger k such that G has a total k-coloring.
图G的全染色数xT(G)是指使G全k染色的最小整数k。
6) Renverse principal component analysis
全色数据
补充资料：连分数的渐近分数
连分数的渐近分数
convergent of a continued fraction
连分数的渐近分数l阴ve吧e时ofa阴‘毗d五，比.;n侧卫xp口.坦”八卯6‘] 见连分数(con tinued fraction).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条