Indexed metadata
A note on the proof of Barnette's conjecture
Zhentao Li
Source 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}.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.