Abstract.
A well-known result by O. Ore is that every graph of order n with d(u)+d(v)≥n+1 for any pair of nonadjacent vertices u and v is hamiltonian connected (i.e., for every pair of vertices, there is a hamiltonian path joining them). In this paper, we show that every 3-connected claw-free graph G on at most 5δ−8 vertices is hamiltonian connected, where δ denotes the minimum degree in G. This result generalizes several previous results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Acknowledgments. The author would like to thank the referee for his important suggestions and careful corrections.
Final version received: March 12, 2003
Supported by the project of Nature Science Funds of China
Rights and permissions
About this article
Cite this article
Li, M. Hamiltonian Connected Claw-Free Graphs. Graphs and Combinatorics 20, 341–362 (2004). https://doi.org/10.1007/s00373-004-0559-6
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0559-6