Longest cycles in generalized Buckminsterfullerene graphs

DOI10.1007/BF01166604zbMath0873.05075OpenAlexW1974415344MaRDI QIDQ1360640

Stanlislav Jendroľ, Peter J. Owens

Publication date: 20 October 1997

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

Full work available at URL: https://doi.org/10.1007/bf01166604

zbMATH Keywords

cyclepolyhedral graph

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• On shortness exponents of families of graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes
• Hamiltonian circuits in polytopes with even sided faces
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Regular planar graphs with faces of only two types and shortness parameters
• A class of Hamiltonian polytopes

This page was built for publication: Longest cycles in generalized Buckminsterfullerene graphs