Tait's conjecture on Hamiltonian planar cubic graphs
Statement
Let be a -regular, -connected planar graph. Tait's conjecture. Every such graph is Hamiltonian. The conjecture was disproved by W. T. Tutte, who constructed a counterexample on vertices; further counterexamples were found on vertices by Holton and McKay.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.