Hamilton decomposition of prisms over 3-connected cubic planar graphs
Statement
Conjecture Every prism over a -connected cubic planar graph can be decomposed into two Hamilton cycles.
Record
- Source
- Added
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.