The linear Hamiltonian cycle conjecture for 4-connected maximal planar graphs
Statement
Let a 4MP be a 4-connected maximal planar graph, and let a linear Hamiltonian cycle be a Hamiltonian cycle such that the regions on one side of the cycle share edges with at most two other regions on that side; equivalently, the dual of those regions is a path. Linear Hamiltonian cycle conjecture. Every 4MP has a linear Hamiltonian cycle. Hamiltonian cycles in 4-connected maximal planar graphs correspond to pairs of spanning 2-trees, and Whitney's theorem guarantees that every 4MP is Hamiltonian. The stronger linearity requirement is the assertion at issue here; the supplied text does not give a resolution, so its status remains open.
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.