arXiv Analytics

Sign in

arXiv:0801.3854 [math.CO]AbstractReferencesReviewsResources

Long cycles in fullerene graphs

D. Král', O. Pangrác, J. -S. Sereni, R. Skrekovski

Published 2008-01-24, updated 2011-01-24Version 3

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.

Comments: 12 pages, 10 figures
Journal: Journal of Mathematical Chemistry, 45(4):1021--1031, 2009
Categories: math.CO
Subjects: 05C38, 92E10
Related articles: Most relevant | Search more
arXiv:0711.4394 [math.CO] (Published 2007-11-28, updated 2007-11-30)
A note on a degree sum condition for long cycles in graphs
arXiv:0809.0702 [math.CO] (Published 2008-09-03)
Long cycles in graphs through fragments
arXiv:1203.3912 [math.CO] (Published 2012-03-18, updated 2012-05-22)
Odd cycle transversals and independent sets in fullerene graphs

Links

Toolbox