Fleischner's dominating circuit conjecture for cyclically 4-edge-connected snarks
Statement
A snark is a bridgeless cubic graph that is not 3-edge-colourable, and a graph is cyclically 4-edge-connected if no edge cut of size less than separates two components each containing a circuit. A dominating circuit in a graph is a circuit such that every edge of has an end-vertex on .
Fleischner's dominating circuit conjecture. Every cyclically -edge-connected snark has a dominating circuit.
The conjecture is one of several equivalent forms of the dominating-cycle problem and is related to the Matthews–Sumner conjecture on hamiltonian claw-free graphs. The source reports computational verification that it has no counterexample on or fewer vertices, but its general 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.