A note about the dominating circuit conjecture

Authors:
Herbert Fleischner;Martin Kochol
Affiliations:
Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, A-1010 Vienna, Austria;MÚ SAV, Stefánikova 49, 814 73 Bratislava 1, Slovakia
Venue:
Discrete Mathematics
Year:
2002

Citing 2
Cited 1

Equivalence of Fleischner's and Thomassen's conjectures

Journal of Combinatorial Theory Series B
Stable dominating circuits in snarks

Discrete Mathematics

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.05

Visualization

Abstract

The dominating circuit conjecture states that every cyclically 4-edge-connected cubic graph has a dominating circuit. We show that this is equivalent to the statement that any two edges of such a cyclically 4-edge-connected graph are contained in a dominating circuit.