节点文献
关于Ore-3型图-Win猜想的部分结果
On the Graphs of Ore-Type-(3)-A Result of Win’s Conjecture
【摘要】 证明了Win猜想对k=3成立。实际上,且得到了更好的结论:2n(n≥10)阶Ore-3型图中存在边不交的两个Hamilton圈和一个1-因子,且对δ(G)=5而言,结论是最好可能的。
【Abstract】 It is proved that Win’s conjecture is true for k = 3. A better conclusion is obtained. There exist two Hamilton cycles and a 1-factor which are edge-disjoint in a Ore-type-(3) graph of order 2n (n≥10). Moreover, this result is best possible for δ(G)=5.
- 【文献出处】 北京科技大学学报 ,Journal of University of Science and Technology Beijing , 编辑部邮箱 ,1991年02期
- 【被引频次】1
- 【下载频次】17