Hamiltonian k-Factors in Graphs

Journal of Graph Theory

Volumn 25, Issue 3, 1997, Pages 217-227

  Wei, Bing ^a   Zhu, Yongjin ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Hamiltonian cycles; Hamiltonian k factors; k factors

Indexed keywords

EID: 0031504137     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199707)25:3<217::AID-JGT5>3.0.CO;2-O     Document Type: Article

References (6)

1. J. A. Bondy and Chvátal, A method in graph theory. Discrete Math. 15 (1976), 111-135.
2. J. A. Bondy and Murty, Graph theory with applications, Macmillean, London, and Elsvevier, New York (1976).
3. G. A. Dirac, Some theorems on abstract graphs. Proc. London Math. Soc. 2 (1952), 69-81.
4. P. Katerinis and D. R. Woodall, Binding numbers of graphs and the existence of k-factors. Quart. J. Math. 38 (1987), 221-228.
5. H. Li and Y. Zhu, Edge-disjoint hamilton cycles in graphs. Ann. N Y Acad. Sci. 576 (1989), 311-322.
6. W. T. Time, The factors of graphs. Canad. J. Math. 4 (1952), 314-328.