Tutte's conjecture on Hamiltonian cubic bipartite graphs
Let be a -regular, -connected bipartite graph. Tutte's conjecture. Every such graph is Hamiltonian. The supplied text introduces this conjecture after noting that the known counterexamples to Tait's conjecture were not bipartite; its resolution is not stated in the supplied material.
References
Primary source
Saptarshi Bej, “Hamiltonian cycles in annular decomposable Barnette graphs”, arXiv:2008.06671 (2020).
Additional references
2 papers in this index state this conjecture (2013–2020). The statement above is taken from the most recent of them; the others are arXiv:1310.5504.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.