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

Li Mingchu; Wang Bingtuan; Xiong Liming

doi:10.13374/j.issn1001-053x.1994.03.019

Volume 16 Issue 3

Nov. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1994 > 16(3): 289-293

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

Citation:

PDF( 437 KB)

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

doi: 10.13374/j.issn1001-053x.1994.03.019

1. Department of Mathematics and Mechanics, USTB, Beijing 100083, PRC;
2. Jiangxi Normal University

Received Date: 1993-01-05
Available Online: 2021-11-13

Abstract

Abstract

It was proved by S Win in 1982 that every Ore-type-(1) graph of order 2ⁿ 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.
- Ore-type-(-2) graph,
- 1-factor,
- Hamilton cycle