Skip to main content
Log in

On the Cycle Spectrum of Cubic Hamiltonian Graphs

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

Abstract

We prove lower bounds on the number of different cycle lengths of cubic Hamiltonian graphs that do not contain a fixed subdivision of a claw as an induced subgraph.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bondy J.A.: Pancyclic graphs I. J. Comb. Theory Ser. B 11, 80–84 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clark L.: Hamiltonian properties of connected locally connected graphs. Congr. Numerantium 32, 199–204 (1981)

    Google Scholar 

  3. Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  4. Faudree R.J., Ryjáček Z., Schiermeyer I.: Local connectivity and cycle extension in claw-free graphs. Ars Comb. 47, 185–190 (1997)

    MATH  Google Scholar 

  5. Ferrara M., Jacobson M.S., Harris A.: Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum. Graphs Comb. 26, 215–223 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Li M.: Vertex pancyclism in claw-free graphs. Discrete Math. 188, 151–173 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Marczyk A.: On the structure of the set of cycle lengths in a Hamiltonian graph. Discrete Math. 286, 133–140 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Marczyk A.: Cycles in graphs and related problems. Diss. Math. 454, 98 (2008)

    MathSciNet  Google Scholar 

  9. Marczyk A., Woźniak M.: Cycles in Hamiltonian graphs of prescribed maximum degree. Discrete Math. 266, 321–326 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Milans, K., Rautenbach, D., Regen, F., West, D., Pfender, F.: Cycle spectra of hamiltonian graphs (Preprint)

  11. 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  MathSciNet  MATH  Google Scholar 

  12. Ore O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pfender F.: A note on cycle spectra of line graphs. Discrete Math. 309, 2922–2924 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sasse, T.: Cycle lengths in cubic Hamiltonian graphs. Bachelor thesis, TU Ilmenau (2010)

  15. Schelten U., Schiermeyer I.: Small cycles in Hamiltonian graphs. Discrete Appl. Math. 79, 201–211 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schmeichel E.F., Hakimi S.L.: A cycle structure theorem for Hamiltonian graphs. J. Comb. Theory Ser. B 45, 99–107 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  17. van Blanken E., van den Heuvel J., Veldman H.J.: Pancyclicity of Hamiltonian line graphs. Discrete Math. 138, 379–385 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dieter Rautenbach.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Müttel, J., Rautenbach, D., Regen, F. et al. On the Cycle Spectrum of Cubic Hamiltonian Graphs. Graphs and Combinatorics 29, 1067–1076 (2013). https://doi.org/10.1007/s00373-012-1156-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1156-0

Keywords

Mathematical Subject Classification

Navigation