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.
Similar content being viewed by others
References
D. Bakowies and W. Thiel, J. Amer. Chem. Soc. 113 (1991) 3704.
G. Ewald, Israel J. Math. 16 (1973) 53.
P.R. Goodey, Israel J. Math. 22 (1975) 52.
P.R. Goodey, J. Graph Theory 1 (1977) 181.
B. Grünbaum,Convex Polytopes (Interscience, New York, 1967).
P.E. John and R.B. Mallion, J. Math. Chem. 15 (1994) 261.
H.W. Kroto, J.R. Heath, S.C. O'Brien, R.F. Curl and R.E. Smalley, Nature 318 (1985) 162.
P.J. Owens, Discr. Math. 36 (1981) 227.
P.J. Owens, Ann. Discr. Math. 20 (1984) 241.
P.J. Owens, J. Graph Theory 8 (1984) 253.
M. Tkáč, Discr. Math. 128 (1994) 407.
H. Walther, Discr. Math. 33 (1981) 107.
J. Zaks, Discr. Math. 29 (1980) 87.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01166604