Barnette Graphs with Faces up to Size 8 are Hamiltonian
Abstract
Barnette's conjecture states that every cubic, bipartite, planar and 3-connected graph is Hamiltonian. Goodey verified Barnette's conjecture for all graphs with faces of size up to 6. We substantially strengthen Goodey's result by proving Hamiltonicity for cubic, bipartite, planar and (2-)connected graphs with faces of size up to 8. Parts of the proof are computational, including a distinction of 339.068.624 cases.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.