Skip to main content
Log in

Longest cycles in generalized Buckminsterfullerene graphs

  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Abstract

It is shown that every regular 3-valent polyhedral graph whose faces are all 5-gons and 6-gons contains a cycle through at least 4/5 of its vertices.

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. D. Bakowies and W. Thiel, J. Amer. Chem. Soc. 113 (1991) 3704.

    Google Scholar 

  2. G. Ewald, Israel J. Math. 16 (1973) 53.

    Google Scholar 

  3. P.R. Goodey, Israel J. Math. 22 (1975) 52.

    Google Scholar 

  4. P.R. Goodey, J. Graph Theory 1 (1977) 181.

    Google Scholar 

  5. B. Grünbaum,Convex Polytopes (Interscience, New York, 1967).

    Google Scholar 

  6. P.E. John and R.B. Mallion, J. Math. Chem. 15 (1994) 261.

    Google Scholar 

  7. H.W. Kroto, J.R. Heath, S.C. O'Brien, R.F. Curl and R.E. Smalley, Nature 318 (1985) 162.

    Google Scholar 

  8. P.J. Owens, Discr. Math. 36 (1981) 227.

    Google Scholar 

  9. P.J. Owens, Ann. Discr. Math. 20 (1984) 241.

    Google Scholar 

  10. P.J. Owens, J. Graph Theory 8 (1984) 253.

    Google Scholar 

  11. M. Tkáč, Discr. Math. 128 (1994) 407.

    Google Scholar 

  12. H. Walther, Discr. Math. 33 (1981) 107.

    Google Scholar 

  13. J. Zaks, Discr. Math. 29 (1980) 87.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jendrol', S., Owens, P.J. Longest cycles in generalized Buckminsterfullerene graphs. J Math Chem 18, 83–90 (1995). https://doi.org/10.1007/BF01166604

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01166604

Keywords

Navigation