李明楚, 李忠祥. 关于Ore-(1)型图中的Hamilton圈[J]. 工程科学学报, 1992, 14(4): 483-489. DOI: 10.13374/j.issn1001-053x.1992.04.031
引用本文: 李明楚, 李忠祥. 关于Ore-(1)型图中的Hamilton圈[J]. 工程科学学报, 1992, 14(4): 483-489. DOI: 10.13374/j.issn1001-053x.1992.04.031
shu
Li Mingchu, Li Zhongxiang. Hamilton Cycles in the Graphs of Ore-Type-(1)[J]. Chinese Journal of Engineering, 1992, 14(4): 483-489. DOI: 10.13374/j.issn1001-053x.1992.04.031
Citation: Li Mingchu, Li Zhongxiang. Hamilton Cycles in the Graphs of Ore-Type-(1)[J]. Chinese Journal of Engineering, 1992, 14(4): 483-489. DOI: 10.13374/j.issn1001-053x.1992.04.031
shu

关于Ore-(1)型图中的Hamilton圈

Hamilton Cycles in the Graphs of Ore-Type-(1)

    摘要
  • 摘要: 1982年Win证明了:2n阶Ore-(1)型图G有边不交的一个Hamilton圈和一个1-因子。本文证明了:在几乎与Win定理的条件相同的情况下,Ore-(1)型图有边不交的两个Hamilton圈和一个1-因子。

     

    Abstract: It was proved by S. Win in 1982 that if the sum of the degree of nonadjacent vertices of a simple graph G of order 2n is at least 2n + 1, then G has a Hamilton cycle and a 1-factor which are edge-disjoint. In this paper, it is proved that, under almost the same condition as Win's theorem, G has at least two Hamilton cycles and a 1-factor which are edge-disjoint.

     

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

/

返回文章
返回