Edge disjoint Hamilton cycles in graphs

Journal of Graph Theory

Volumn 35, Issue 1, 2000, Pages 8-20

  Li, Guojun ^a  

^a SHANDONG UNIVERSITY   (China)

Author keywords

Edge disjoint Hamilton cycles; Fan 2k type graph; Graph

Indexed keywords

EID: 23044520178     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200009)35:1<8::AID-JGT2>3.0.CO;2-K     Document Type: Article

References (8)

1. L. W. Beineke and R. L. Wilson, Selected Topics in Graph Theory, Academic Press, New York, 1978, 161 p.
2. J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, MacMillan, London, 1976.
3. G. H. Fan, New sufficient condition for cycles in graphs, J Combin Theory B37 (1984), 221-227.
4. R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Edge disjoint Hamiltonian cycles. Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich; 1984), Wiley-Interscience New York (1985) 231-249, MR 87c:05104.
5. H. Li, Edge disjoint cycles in graphs, J Graph Theory 3 (1989), 313-322.
6. O. Ore, Note on Hamilton circuits. Am Math Monthly 67 (1960), 55.
7. F. Tian, A short proof of a theorem about the circumference of a graph, J Combin Theory B45 (1988), 373-375.
8. S. Zhou, Disjoint Hamiltonian cycles in Fan 2k-type graphs, J Graph Theory 3 (1989), 313-322.