Barnette's Conjecture
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
Barnette's conjecture asserts that every finite, simple, cubic, bipartite, planar, 3-connected graph has a Hamiltonian cycle. It remains one of the central open problems about Hamiltonicity in planar graphs.
This submission presents the conjecture as an open theorem statement over finite simple graphs. Four separate definition concepts introduce 3-connected graphs, cubic graphs, bipartite graphs, and Hamiltonian cycles. Planarity is deliberately not duplicated: the conjecture imports the straight-line-drawing predicate from the Planar Graph Classes submission. No proof is supplied.
Recent progress proves the conjecture for Barnette graphs whose faces all have size at most eight. Maximum face size ten is the next natural restricted case.
Concepts
- def
Bipartite - def
Cubic - def
HamiltonianCycle - def
ThreeConnected
Concept map
Proofs
No proofs in this submission.
Related submissions
Submission map
Cite this
This is only the formalizers. The authors of the formalized results may be different (see References).
@misc{lax-881656,
author = {Clemens Kuske},
title = {Barnette's Conjecture},
year = {2026},
howpublished = {Lax Archive, lax-881656},
url = {https://laxarchive.org/lax-881656/},
}
References
- Tobias Schnieders. Barnette Graphs with Faces up to Size 8 are Hamiltonian. 2025. doi:10.48550/arXiv.2508.03531 · arXiv:2508.03531
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments