2) disjoint 6-cycle
独立6-圈
1.
We show that if the minimum degree of G is at least 2k-1,then G contains at least k-1 disjoint 6-cycles.
若G的最小度至少为2k-1,则G至少包含k-1个独立6-圈。
3) disjoint directed 6-cycles
独立有向6-圈
1.
We show that if the minimum degree of D is at least 5k,then D contains k disjoint directed 6-cycles.
证明了若有向二部图D=(V1,V2:A)的最小度至少为5k,则D有k个顶点不交的独立有向6-圈。
4) cycle
[英]['saikl] [美]['saɪkəl]
圈
1.
Total Coloring Conjecture of Planar Graphs Without l-cycles;
不含l-圈平面图的全染色猜想
2.
A note on total colorings of planar graphs without 4-cycle and adjacent 3-cycle;
不含四圈,三圈不重点的平面图全染色的一个结论
3.
On the 3-choosability of Plane Graphs with a Girth of 4 and without 7- and 8- cycles;
围长为4的无7-和8-圈的平面图的3-选色
5) circuit
[英]['sɜ:kɪt] [美]['sɝkɪt]
圈
1.
Borodin and Raspaud proposed a conjecture which claims that every plane graph without 5-circuits and adjacent triangles is 3-colorable.
Borod in和Raspaud提出一个猜想:任何既没有5-圈也没有相邻三角形的平面图是3-可着色。
2.
In this paper we consider the circuit of minimum total weight problem.
讨论权守恒的有向图中最小总权圈问题,分别给出求解一般情况下最小总权圈的最优算法和经过特定点或特定边情况下最小总权圈的最优算法。
3.
This article provides a number of new ways to access the famous conjecture on the double covering of graphs by circuits which is still open for more than 20 years in posing a number of conjectures which look to have more approaches than what has been used for the double cover conjecture by circuits.
本文提出了一些新的方法以接近图的用圈二重覆盖边的猜想，通称图的双圈覆盖猜想。
6) circle
[英]['sɜ:kl] [美]['sɝkḷ]
圈
1.
Vertex-distinguishing edge-coloring of graphs with distance between path and circle less than 3 and 4;
路和圈的距离不大于3和4的点可区别边染色
2.
This paper narrated and proved an minimal spanning tree algorithm which requires no consideration of circles.
从树的等价定义出发,叙述并证明了一种不必考虑圈的求最小支撑树的算法。
补充资料："大东亚共荣圈"
见太平洋战争。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条