The existence of Kotzig-frames in cyclically 4-edge-connected cubic graphs
Statement
A cubic graph is a graph in which every vertex has degree . A graph is cyclically -edge connected if no edge cut of fewer than four edges separates two subgraphs each containing a cycle. A Kotzig graph is a cubic graph admitting a proper -edge-coloring such that each bicolored cycle is hamiltonian. For a -connected cubic graph , a Kotzig-frame is a spanning subgraph such that every component of has an even number of vertices and every component is either a cycle or a subdivision of a Kotzig graph.
Kotzig-frame existence conjecture. Every cyclically -edge connected cubic graph has a Kotzig-frame.
The paper notes that no cyclically -edge connected cubic graph without a Kotzig-frame was known at the time. A Kotzig-frame can yield a cycle double cover under additional conditions, so establishing the conjecture would support the cycle double cover program.
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.