Long cycles in fullerene graphs

Details Long cycles in fullerene graphs Long cycles in fullerene graphs

2008-01-24

arxiv.org/abs/0801.3854v3

Journal of Mathematical Chemistry, 45(4):1021--1031, 2009

Mathematics

Combinatorics

12 pages, 10 figures

Scientific paper

10.1007/s10910-008-9390-7

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.

Affiliated with

Also associated with

No associations

Rating

Long cycles in fullerene graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Long cycles in fullerene graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long cycles in fullerene graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-412069