On factors of 4-connected claw-free graphs

Journal of Graph Theory

Volumn 37, Issue 2, 2001, Pages 125-136

  Broersma, H J ^a   Kriesell, M ^a   Ryjacek Z ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

Claw free graph; Factor; Hamilton cycle; Hamilton path; Line graph

Indexed keywords

EID: 31244437947     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1008     Document Type: Article

References (15)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. Macmillan, London and Elsevier, New York, 1976.
2. J. Brousek, Z. Ryjáček, and I. Schiermeyer, Forbidden subgraphs, stability and hamiltonicity, Preprint (1997).
3. F. Harary and C. St. J. A. Nash-Williams, On eulerian and hamiltonian graphs and line graphs, Canad Math Bull 8 (1965), 701-710.
4. S. Ishizuka, Closure, path factors and path coverings in claw-free graphs, Preprint (1998).
5. B. Jackson, Hamilton cycles in 7-connected line graphs, Preprint (1989).
6. B. Jackson and N. C. Wormald, k-Walks of graphs, Australasian Journal of Combinatorics 2 (1990), 135-146.
7. M. Kochol, Sublinear defect principle in graph theory, Manuscript (1999).
8. M. Kriesell, All 4-connected line graphs of claw-free graphs are hamiltonian-connected, Preprint (1998).
9. S. Kundu, Bounds on the number of disjoint spanning trees, J Combin Theory B 17 (1974), 199-203.
10. 1,3-free graphs, J Graph Theory 8 (1984), 139-146.
11. Z. Ryjáček, On a closure concept in claw-free graphs, J Combin Theory B 70 (1997), 217-224.
12. Z. Ryjáček, A. Saito and R. H. Schelp, Closure, 2-factors and cycle coverings in claw-free graphs, J Graph Theory, (to appear).
13. C. Thomassen, Reflections on graph theory, J Graph Theory 10 (1986), 309-324.
14. S. Zhan, Hamiltonian connectedness of line graphs, Ars Combinatoria 22 (1986), 89-95.
15. S. Zhan, On hamiltonian line graphs and connectivity, Discrete Math 89 (1991), 89-95.