Goddyn's conjecture on cycle double covers
Statement
Let be a bridgeless graph, and let be a cycle in . A cycle double cover is a list of cycles in in which each edge appears exactly twice.
Goddyn's conjecture. There exists a cycle double cover of containing .
The paper says its proof resolves this stronger conjecture for 3-regular graphs, while the conjecture remains unresolved for graphs that are not 3-regular. Thus the general statement 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.