李明楚, 李忠祥. 关于Ore-3型图-Win猜想的部分结果[J]. 工程科学学报, 1991, 13(2): 186-190. DOI: 10.13374/j.issn1001-053x.1991.02.016
引用本文: 李明楚, 李忠祥. 关于Ore-3型图-Win猜想的部分结果[J]. 工程科学学报, 1991, 13(2): 186-190. DOI: 10.13374/j.issn1001-053x.1991.02.016
shu
Li Mingchu, Li Zhongxiang. On the Graphs of Ore-Type-(3)-A Result of Win's Conjecture[J]. Chinese Journal of Engineering, 1991, 13(2): 186-190. DOI: 10.13374/j.issn1001-053x.1991.02.016
Citation: Li Mingchu, Li Zhongxiang. On the Graphs of Ore-Type-(3)-A Result of Win's Conjecture[J]. Chinese Journal of Engineering, 1991, 13(2): 186-190. DOI: 10.13374/j.issn1001-053x.1991.02.016
shu

关于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.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回