On the Graphs of Ore-Type-(3)-A Result of Win's Conjecture

Li Mingchu; Li Zhongxiang

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

Volume 13 Issue 2

Oct. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1991 > 13(2): 186-190

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

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

PDF( 452 KB)

On the Graphs of Ore-Type-(3)-A Result of Win's Conjecture

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

Department of Mathematics and Mechanics

Received Date: 1990-09-11
Available Online: 2021-10-23

Abstract

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