Long cycles in fullerene graphs

DOI10.1007/s10910-008-9495-zzbMath1196.92049OpenAlexW1999368278MaRDI QIDQ5902228

Rok Erman, František Kardoš, Jozef Miškuf

Publication date: 16 November 2009

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-008-9495-z

zbMATH Keywords

2-factorHamilton cyclefullerenelong cyclefullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ Distance-two colourings of Barnette graphs ⋮ Hamiltonian cycles in some family of cubic 3-connected plane graphs ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• On shortness exponents of families of graphs
• Fullerene graphs have exponentially many perfect matchings
• Saturation number of fullerene graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• The existence of certain planar maps
• Hamiltonian circuits in polytopes with even sided faces
• On lower bounds of number of perfect matchings in fullerene graphs
• Longest cycles in generalized Buckminsterfullerene graphs
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• The independence numbers of fullerenes and benzenoids
• A class of Hamiltonian polytopes
• Long cycles in fullerene graphs

This page was built for publication: Long cycles in fullerene graphs