Fleischner's dominating circuit conjecture for cyclically 4-edge-connected snarks
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.
References
2 papers in this index state this conjecture (2015–2017). The statement above is taken from the most recent of them; the others are arXiv:1512.05944.
Source: Jan Goedgebeur, Edita Máčajová and Martin Škoviera, “Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44”, arXiv:1712.07867 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.