Long cycles in fullerene graphs
Combinatorics
2011-01-25 v3
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.
Keywords
Cite
@article{arxiv.0801.3854,
title = {Long cycles in fullerene graphs},
author = {D. Král' and O. Pangrác and J. -S. Sereni and R. Skrekovski},
journal= {arXiv preprint arXiv:0801.3854},
year = {2011}
}
Comments
12 pages, 10 figures