Grünbaum's toroidal conjecture on non-3-edge-colorable cubic graphs
Statement
Let be a -connected cubic graph embedded in the torus. Grünbaum's conjecture. If is not -edge-colorable, then contains two edges on the same face of the embedding whose removal gives a planar graph in which the four endpoints of the removed edges lie on the boundaries of two faces. The conjecture is false in general for surfaces of genus , as shown by Kochol, but the paper proves the toroidal case.
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.