Li Mingchu, Wang Bingtuan, Xiong Liming. A New Sufficient Condition for A Graph to Contain Three Disjoint 1-Factors[J]. Chinese Journal of Engineering, 1994, 16(3): 289-293. DOI: 10.13374/j.issn1001-053x.1994.03.019
Citation: Li Mingchu, Wang Bingtuan, Xiong Liming. A New Sufficient Condition for A Graph to Contain Three Disjoint 1-Factors[J]. Chinese Journal of Engineering, 1994, 16(3): 289-293. DOI: 10.13374/j.issn1001-053x.1994.03.019
shu

A New Sufficient Condition for A Graph to Contain Three Disjoint 1-Factors

    Graphical Abstract
    • Abstract
  • It was proved by S Win in 1982 that every Ore-type-(1) graph of order 2n has a Hamilton cycle and a 1-factor which are edge-disjoint.In this paper, we obtain the following theorem Every 2-connected Ore-type-(-2) graph G of order 2n(n ≥ 10) has a Hamilton cycle and a 1-factor which are edge-disjoint unless G is one of the graphs in Figure.
    • FullText(HTML)
  • loading
    • References (0)
    • Related Articles

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return