摘要
1982年Win证明了:2n阶Ore-(1)型图G有边不交的一个Hamilton圈和一个1-因子。本文证明了:在几乎与Win定理的条件相同的情况下,Ore-(1)型图有边不交的两个Hamilton圈和一个1-因子。
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.
出处
《北京科技大学学报》
EI
CAS
CSCD
北大核心
1992年第4期483-489,共7页
Journal of University of Science and Technology Beijing
