Long cycles in fullerene graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Chemistry Année : 2009

Long cycles in fullerene graphs

Résumé

It is conjectured that every fullerene graph is hamiltonian. Jendrol' and Owens proved (J. Math. Chem. 18:83-90, 1995) that every fullerene graph on n vertices has a cycle of length at least 4n/5. Recently, Král' et al. improved it to 5n/6 − 2/3. In this paper, we study 2-factors of fullerene graphs. As a by-product, we get an improvement of a lower bound on the length of the longest cycle in a fullerene graph. We present a constructive proof of the bound 6n/7 + 2/7.
Fichier principal
Vignette du fichier
EKM09.pdf (114.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00966741 , version 1 (27-03-2014)

Identifiants

Citer

Rok Erman, František Kardoš, Jozef Miškuf. Long cycles in fullerene graphs. Journal of Mathematical Chemistry, 2009, 46 (4), pp.1103-1111. ⟨10.1007/s10910-008-9495-z⟩. ⟨hal-00966741⟩

Collections

TDS-MACS
49 Consultations
166 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More