A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian

DOI10.1137/140984737zbMath1430.05022arXiv1409.2440OpenAlexW2998814501WikidataQ123248360 ScholiaQ123248360MaRDI QIDQ5208741

František Kardoš

Publication date: 10 January 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cycleBarnette's conjecturefullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) 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) Computational methods for problems pertaining to combinatorics (05-08)

Related Items

Packing stars in fullerenes, Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture, At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles, Distance-two colourings of Barnette graphs, Hamiltonian cycles in some family of cubic 3-connected plane graphs, Matching theory and Barnette's conjecture

Cites Work

• 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