Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes

DOI10.1137/22M1476915zbMath1489.05085MaRDI QIDQ5075839

František Kardoš

Publication date: 12 May 2022

Published in: SIAM Review (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleBarnette's conjecturefullerene graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Eulerian and Hamiltonian graphs (05C45) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Hamiltonian circuits in polytopes with even sided faces
• Longest cycles in generalized Buckminsterfullerene graphs
• Polyhedra of small order and their Hamiltonian properties
• A class of Hamiltonian polytopes
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• Long cycles in fullerene graphs
• Long cycles in fullerene graphs
• A constructive enumeration of nanotube caps

This page was built for publication: Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes