9-Connected Claw-Free Graphs Are Hamilton-Connected

Journal of Combinatorial Theory. Series B

Volumn 75, Issue 2, 1999, Pages 167-173

  Brandt, Stephan ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007279865     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1871     Document Type: Article

References (10)

1. D. Bauer, H. J. Broersma, H. J. Veldman, Not every 2-tough graph is hamiltonian.
2. Bondy J. A., Chvátal V. A method in graph theory. Discrete Math. 15:1976;111-136.
3. S. Brandt, O. Favaron, Z. Ryjáček, Closure and stable hamiltonian properties in claw-free graphs.
4. 4. Discrete Math. 121:1993;19-23.
5. Broersma H. J., Trommel H. Closure concepts for claw-free graphs. Discrete Math. 185:1998;231-238.
6. Hemminger R. L., Beineke L. W. Line graphs and line digraphs. Selected Topics in Graph Theory. 1978;Academic Press, London. p. 271-305.
7. 1, 3. J. Graph Theory. 8:1984;139-146.
8. Ryjáček Z. On a closure concept in claw-free graphs. J. Combin. Theory Ser. B. 70:1997;217-224.
9. West D. B. Introduction to Graph Theory. 1996;Prentice-Hall, New York.
10. Zhan S. On hamiltonian line graphs and connectivity. Discrete Math. 89:1991;89-95.