A computer-assisted proof of Barnette-Goodey conjecture: Not only fullerene graphs are Hamiltonian

2014/09/08 by Kardoš, František
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1409.2440

Abstract

Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be Hamiltonian. This is a special case of a conjecture of Barnette and Goodey, stating that 3-connected planar graphs with faces of size at most 6 are Hamiltonian. We prove the conjecture.

Related

• Barnette Graphs with Faces up to Size 8 are Hamiltonian
• Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
• Algorithmic proof of Barnette's Conjecture
• A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
• Thoughts on Barnette's Conjecture