Premium
Hamiltonian κ‐factors in graphs
Author(s) -
Wei Bing,
Zhu Yongjin
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199707)25:3<217::aid-jgt5>3.0.co;2-o
Subject(s) - mathematics , combinatorics , hamiltonian path , hamiltonian (control theory) , graph , pancyclic graph , discrete mathematics , hamiltonian path problem , quartic graph , graph power , line graph , 1 planar graph , mathematical optimization
Let κ ≥ 2 be an integer. A k‐factor F of a graph G is called a hamiltonian k‐factor if F contains a Hamiltonian cycle. In this paper, we shall prove that if G is a graph of order n with κ ≥ 2,n ≥ 8κ ‐ 4, κn even and δ(G) ≥ n/2, then G has a hamiltonian k‐factor. © 1997 Wiley & Sons, Inc. J Graph Theory 25: 217–227, 1997