2) the first kind weak total chromatic number
第一类弱全色数
1.
The minimal number of k is called the the first kind weak total chromatic number of G.
给出了路与轮,轮与轮联图的第一类弱全色数。
2.
The minimal number of k is called the first kind weak total chromatic number of G,In this paper,we discuss the the first kind weak total chromatic number of the adjacent graph of path and wheel,wheel and wheel.
给出了星与扇,扇与扇,轮与扇联图的第一类弱全色数。
3) weak totol coloring
弱全着色
4) weak global dimension
弱全局维数
5) first weak total coloring
第一类弱全染色
1.
On a number of the first weak total coloring of double graphs
关于若干倍图的第一类弱全染色
6) 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的全色数。
补充资料：弱弱联合
弱弱联合是指两个总体实力都不强但都拥有自己独特的某方面优势的企业之间进行联合，以形成较强的实力。弱弱联合，弱企业之间优势互补，可以形成整体实力变强的效应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条