1) 2 coloring Ramsey graph
二色边完全图
2) complete bipartite graph
完全二部图
1.
Cylic m-cycle decompositions of the complete bipartite graphs K_(n,n) for m≡0 (mod8);
m≡0(mod8)时完全二部图K_(n,n)的循环m-圈分解
2.
The K_(1,k～-)-factorization of complete bipartite graphs;
完全二部图的K_(1,k～-)因子分解
3.
Vertex-distinguishing VE-total colorings of wheels,fans and complete bipartite graphs K_(1,n) and K_(2,n)
轮、扇以及完全二部图K_(1,n)和K_(2,n)的点可区别VE-全染色(英文)
3) complete bipartite graph
完全二分图
1.
Unilateral successful number a2(K1,n) of the star-game on some complete bipartite graph Kp,p has been defined in this paper.
给出了在完全二分图Kp,p上星博弈时一方成功数a2(K1,n)的定义:甲乙二人在完全二分图Kp,p上博弈,首先甲用绿色对Kp,p的一条边染色,接着乙用红色染Kp,p的另一条无色边,如此甲乙交替地对Kp,p的无色边进行着色。
2.
The counting and the construction of spanning trees in a complete bipartite graph Km,n are presented.
介绍了完全二分图K3,3的生成树的计数和构造。
4) complete bipartite graphs
完全二部图
1.
In addition,we determine the signed tree domination numbers for some special classes of graphs G,including cycles,wheels,complete graphs and complete bipartite graphs.
引入了图的符号树控制的概念,给出一个连通图G的符号树控制数γ′T(G)的一个上界和一个下界,说明了这两个界限均是最好可能的,并确定几类特殊图的符号树控制数,这包括了圈、轮图、完全图和完全二部图。
2.
Cocktail party graphs CP(n)=K_(2n)-nK_2 and complete bipartite graphs K_aa all are integral graphs.
图G是一个简单,图G的补图记为G,如果G的谱完全由整数组成,就称G是整谱图,鸡尾酒会图CP (n)=K_(2n)-nK_2(K_(2n)是完全图)和完全二部图K_(a,a)都是整谱图。
3.
Cocktail party graphs CP(n)=K2n-nK2 and complete bipartite graphs Ka,a all are integral graphs[1].
鸡尾酒会图CP(n)=K2n-nK2(K2n是2n阶完全图)和完全二部图Ka,a都是整谱图。
5) complement of bipartite graph
二部完全图
6) complete balanced bipartite graph
完全等二部图
1.
In this paper,the total chromatic number of Fm∨Kn,n is obtained by using some lemmas including Vizing theorem and inductive method,in which Fm is a fan and Kn,n ia a complete balanced bipartite graph.
研究m+1阶扇Fm与完全等二部图Kn,n的联图Fm∨Kn,n的全色数问题。
2.
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。
补充资料：边色
1.边地的风物景色。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条