HAMILTONIAN K-FACTORS IN GRAPHS

Authors
WEI B ZHU YJ
Citation
B. Wei et Yj. Zhu, HAMILTONIAN K-FACTORS IN GRAPHS, Journal of graph theory, 25(3), 1997, pp. 217-227
Citations number
6
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
25
Issue
3
Year of publication
1997
Pages
217 - 227
Database
ISI
SICI code
0364-9024(1997)25:3<217:HKIG>2.0.ZU;2-X
Abstract
Let k greater than or equal to 2 be an integer. A k-factor F of a grap h 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 k greater than or equal to 2, n greater than or equal to 8k - 4, kn eve n and delta(G) greater than or equal to n/2, then G has a hamiltonian k-factor. (C) 1997 John Wiley & Sons, Inc.