%0 Journal Article
%T Long cycles in fullerene graphs
%A D. Kr¨¢l'
%A O. Pangr¨¢c
%A J. -S. Sereni
%A R. Skrekovski
%J Mathematics
%D 2008
%I arXiv
%R 10.1007/s10910-008-9390-7
%X 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.
%U http://arxiv.org/abs/0801.3854v3