Hamiltonicity of cubic planar graphs with bounded face sizes

DOI10.1137/22M1476915zbMATH Open1489.05085MaRDI QIDQ5075839FDOQ5075839

Authors: František Kardoš 

Publication date: 12 May 2022

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

Recommendations

• A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
• Hamiltonian cycles in some family of cubic 3-connected plane graphs
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
• On Barnette's conjecture

zbMATH Keywords

Hamiltonian cycleBarnette's conjecturefullerene graph

Mathematics Subject Classification ID

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

Cites Work

• Hamiltonian circuits in polytopes with even sided faces
• Geometric folding algorithms. Linkages, origami, polyhedra
• Catalog of all fullerenes with ten or more symmetries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• A class of Hamiltonian polytopes
• A constructive enumeration of nanotube caps
• Title not available (Why is that?)
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Title not available (Why is that?)
• Long cycles in fullerene graphs
• Long cycles in fullerene graphs
• Longest cycles in generalized Buckminsterfullerene graphs
• Polyhedra of small order and their Hamiltonian properties

Cited In (9)

• Hamilton cycles in cubic polyhex graphs on the Klein bottle.
• Long cycles in fullerene graphs
• Highly-connected planar cubic graphs with few or many Hamilton cycles
• A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
• Hamiltonicity of planar cubic multigraphs
• Hamiltonian cycles in some family of cubic 3-connected plane graphs
• Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Hamiltonicity of cubic planar graphs with bounded face sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075839)