Abstract
It is conjectured that every fullerene graph is hamiltonian. Jendrol’ and Owens proved [J. Math. Chem. 18 (1995), pp. 83–90] that every fullerene graph on n vertices has a cycle of length at least 4n/5. In this paper we, improve this bound to 5n/6 − 2/3.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ewald G.: On shortness exponents of families of graphs. Israel J. Math. 16, 53–61 (1973)
Fowler P.W., Manolpoulos D.E.: An Atlas of Fullerenes. Oxford University Press, Oxford (1995)
Goodey P.R.: A class of hamiltonian polytopes, (special issue dedicated to Paul Turán). J. Graph Theor. 1, 181–185 (1977)
Goodey P.R.: Hamiltonian circuits in polytopes with even sided faces. Israel J. Math. 22, 52–56 (1975)
Grünbaum B., Zaks J.: The excistence of certain planar maps. Discrete Math. 10, 93–115 (1974)
Jendrol’ S., Owens P.J.: Longest cycles in generalized Buckminsterfullerene graphs. J. Math. Chem. 18, 83–90 (1995)
Krätschmer W., Lamb L.D., Fostiropoulos K., Huffman D.R.: Solid C 60: a new form of carbon. Nature 347, 354–358 (1990)
Kroto H.W., Heath J.R., O’Brien S.C., Curl R.F., Smalley R.E.: C 60 Buckminsterfullerene. Nature 318, 162–163 (1985)
Owens P.J.: Non-hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons. Discrete Math. 36, 227–230 (1981)
Owens P.J.: Non-hamiltonian simple 3-polytopes with only one type of face besides triangles. Ann. Discrete Math. 20, 241–251 (1984)
Owens P.J.: Regular planar graphs with faces of only two types and shortness parameters. J. Graph Theor. 8, 253–257 (1984)
Tait P.G.: Remarks on the coloring of maps. Proc. Royal Soc. Edin. 10, 501–503 (1878–1880)
R. Taylor, J.P. Hare, A.K. Abdul-Sada, H.W. Kroto, Isolation, separation and characterisation of the fullerenes C 60 and C 70: the third form of carbon. J. Chem. Soc. Chem. Commum. 1423–1425 (1990)
Tkáč M.: On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles. Discrete Math. 128, 407–413 (1994)
Tutte W.T.: On hamiltonian cicuits. J. London Math. Soc. 21, 98–101 (1946)
Walther H.: Note on two problems of J. Zaks concerning hamiltonian 3-polytopes. Discrete Math. 33, 107–109 (1981)
Zaks J.: Non-hamiltonian simple 3-polytopes having just two types of faces. Discrete Math. 29, 87–101 (1980)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Král’, D., Pangrác, O., Sereni, JS. et al. Long cycles in fullerene graphs. J Math Chem 45, 1021–1031 (2009). https://doi.org/10.1007/s10910-008-9390-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10910-008-9390-7