A note about the dominating circuit conjecture (Q1861225)

A subgraph \(H\) of a graph \(G\) is dominating if each edge of \(G\) is incident with a vertex of \(H\). A graph is cyclically \(k\)-edge-connected if deleting fewer than \(k\) edges does not result in a graph having at least two components containing cycles. \textit{P. Ash} and \textit{B. Jackson} [Progress in graph theory, Proc. Conf. Combinatorics, Waterloo/Ont. 1982, 81-87 (1984; Zbl 0562.05032)] conjectured that every cyclically \(4\)-edge-connected cubic graph has a dominating circuit. The present authors show that this statement is equivalent to the statement that any two edges of a cyclically \(4\)-edge-connected cubic graph are contained in a dominating circuit.