1) vertex chromatic number
点色数
1.
The generalized vertex chromatic number of a graph and its complementary graphy;
关于图与补图的广义点色数
2.
In this paper,the proper edge coloring and vertex coloring of S_m∨F_n are researched,and the edge chromatic number and vertex chromatic number of join-graph S_m∨F_n are obtained.
并研究了m+1阶的星Sm和n+1阶的扇Fn的联图Sm∨Fn的边染色和点染色,得到了Sm∨Fn的边色数和点色数。
3.
It is discussed that the vertex chromatic numbers on complement double graph of complete graph,cycle and path in this paper.
文章研究了完全图、圈、路的补倍图的点色数。
2) point color number
点色数
1.
The 3 color theorem and 4 color theorem of maximum plate graph are proved: if all the connecting points of n stage (n≥3) maxi mum plate graph G n are even,the point color number is 3, otherwise, it is 4.
证明了极大平面图的3色定理与4色定理:若n(≥3)阶极大平面图Gn中的所有结点均为偶次点,则Gn的点色数为3;否则,Gn的点色数为4。
3) chromatic number
点色数
1.
Using a related theorem in combinatorics and some conclusions known to us in the coloring of the distance graph, the chromatic number χ(G) is determined in this paper that is of the distance graph G(Z,D) for some finite distance sets D containing {2,3} with D=4 and containing .
利用组合数学中的一个相关定理和距离图染色中我们已知的一些结论 ,通过几种周期染色组合的方法 ,本文确定了D =4且D中包含 { 2 ,3}和D =5且包含 { 2 ,3,5 }时某些距离图G(Z ,D)的点色数 χ(D) 。
4) fractional chromatic number
分数点色数
1.
The fractional chromatic numberof a kind of 4-regular cyclic graphs;
一类4-正则循环图的分数点色数
5) vertex-edge total chromatic number
点边全色数
6) vertex strong total chromatic number
点强全色数
1.
The vertex strong total chromatic number of general graphs K(n,m);
广义图K(n,m)的点强全色数
2.
A proper k-total coloring σ of graph G(V,E) is called a k-vertex strong total coloring of G(V,E) if and only if for v∈V(G),the elements in N[v] are colored with different colors,where N[v]={u|vu∈E(G)}∪{v};and χvsT(G)=min{k|there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G.
并且vχsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数。
3.
A proper k-total coloring σ of graph G(V,E)is called a k-vertex strong total coloring of G(V,E)if and only if for ν∈V(G),the elements in N[ν]are colored with different colors,where N[ν]={u|νu∈E(G)}∪{ν};and χ~(νs)_(_T)(G)=min{k|there is a k-vertex strong total coloring of G}is called the vertex strong total chromatic number of G.
并且χνsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数。
补充资料：色数儿
1.即色子。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条