Hamiltonian cycles in 3-connected Claw-free graphs

  title={Hamiltonian cycles in 3-connected Claw-free graphs},
  author={Guojun Li and Mei Lu and Zhenghong Liu},
  journal={Discrete Mathematics},
It is shown that every 3-connected claw-free graph having at most 6 − 7 vertices is hamiltonian, where is the minimum degree. c © 2002 Elsevier Science B.V. All rights reserved. 

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-8 of 8 references

Hamiltonian cycles in 3-connected claw-free graphs

  • M. C. Li
  • J. Graph Theory
  • 1993
1 Excerpt

Hamilton paths and Hamilton-Connected in K1;3-Free Graphs

  • Z. S. Wu
  • Kexue Tongbao
  • 1991
1 Excerpt

Longest paths and cycles in claw-free graphs

  • M. Mathews, D. Summer
  • J. Graph Theory
  • 1985
1 Excerpt

Graph Theory with Applications, Macmillan, London and Elsevier

  • J. A. Bondy, U.S.R. Murty
  • New York,
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…