A note on the proof of Barnette's conjecture
arXiv:2610.30490
Abstract
Barnette's conjecture states that every cubic 3-connected bipartite planar graph has a Hamiltonian cycle. We present a digested exposition of OpenAI's generated proof of Barnette's conjecture \cite{openai-barnette}.
arXiv comment14 pages, 3 figures