Long cycles in fullerene graphs

DOI10.1007/S10910-008-9390-7zbMath1200.92051arXiv0801.3854OpenAlexW3105450988WikidataQ57601466 ScholiaQ57601466MaRDI QIDQ5896980

Riste Škrekovski, Ondřej Pangrác, Jean-Sébastien Sereni, Daniel Král'

Publication date: 2 September 2009

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

Full work available at URL: https://arxiv.org/abs/0801.3854

zbMATH Keywords

Hamilton cyclefullerenelong cyclefullerene graphcubic planar 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 ⋮ Hamiltonian cycles in some family of cubic 3-connected plane graphs ⋮ Long cycles in fullerene graphs ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian

Cites Work

• Unnamed Item
• On shortness exponents of families of graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
• Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes
• The existence of certain planar maps
• Hamiltonian circuits in polytopes with even sided faces
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Longest cycles in generalized Buckminsterfullerene graphs
• Regular planar graphs with faces of only two types and shortness parameters
• A class of Hamiltonian polytopes
• On Hamiltonian Circuits

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