Skip to main content
Log in

On Hamiltonicity of 3-Connected Claw-Free Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Lai, Shao and Zhan (J Graph Theory 48:142–146, 2005) showed that every 3-connected N 2-locally connected claw-free graph is Hamiltonian. In this paper, we generalize this result and show that every 3-connected claw-free graph G such that every locally disconnected vertex lies on some induced cycle of length at least 4 with at most 4 edges contained in some triangle of G is Hamiltonian. It is best possible in some sense.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Broersma H.J., Kriesell M., Ryjáček, Z.: On factors of 4-connected claw-free graphs. J. Graph Theory. 37, 125–136 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brousek J., Ryjáček, Z., Schiermeyer I.: Forbidden subgraphs, stability and hamiltonicity. Discrete Math. 197(198), 29–50 (1999)

    Article  MathSciNet  Google Scholar 

  3. Harary F., St C., Nash-Williams J.A.: On eulerian and hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701–709 (1965)

    Article  MATH  Google Scholar 

  4. Kaiser T., Li M., Ryjáček, Z., Xiong L.: Hourglasses and Hamilton cycle in 4-connected claw-free graphs. J. Graph Theory. 48, 267–276 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lai H.-J.: Graph whose edges are in small cycles. Discrete Math. 94, 11–22 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lai H.-J., Shao Y., Zhan M.: Hamiltonian N 2-locally connected claw-free graphs. J. Graph Theory. 48, 142–146 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Li M., Guo C., Xiong L., Li D., Lai H.-J.: Quadrangularly connected claw-free graphs. Discrete Math. 307, 1205–1211 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Matthews H.M., Sumner D.P.: Hamiltonian results in K 1, 3-free graphs. J. Graph Theory. 8, 139–146 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Oberly D.J., Sumner D.P.: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. J. Graph Theory. 3, 351–356 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pfender F.: Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory. 49, 262–272 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ryjáček, Z.: Hamiltonian circuits in N 2-locally connected K 1, 3-free graphs. J. Graph Theory. 14, 321–331 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ryjáček, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B. 70, 217–224 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Shao, Y.: Claw-free Graphs and Line Graphs, Ph.D. Dissertation, West Virginia University (2005)

  14. Tian R., Xiong L.: On Hamiltonicity of 2-connected claw-free graphs. Appl. Math. J. Chin. Univ. 27(2), 234–242 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. West, D.B.: Introduction to Graph Theory. 2nd edn. Prentice Hall, Upper Saddle River (2001)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liming Xiong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, R., Xiong, L. & Niu, Z. On Hamiltonicity of 3-Connected Claw-Free Graphs. Graphs and Combinatorics 30, 1261–1269 (2014). https://doi.org/10.1007/s00373-013-1343-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1343-7

Keywords

Navigation