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

Li Mingchu; Li Zhongxiang

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

Volume 14 Issue 4

Oct. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1992 > 14(4): 483-489

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

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

PDF( 640 KB)

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

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

Department of Mathematics and Mechanics

Received Date: 1991-08-29
Available Online: 2021-10-16

Abstract

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.
- Hamilton cycle,
- 1-factor,
- Ore-type-(1)