A note about the dominating circuit conjecture

DOI10.1016/S0012-365X(02)00588-5MaRDI QIDQ1861225zbMATH OpenOpenAlexWikidataFDO

Authors Herbert Fleischner, Martin Kochol

Publication date 16 March 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00588-5

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

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.

Recommendations

• The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
• scientific article; zbMATH DE number 4008435
• Dominating cycles in regular 3-connected graphs
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

Cited in

(14)

• Some remarks on Jaeger's dual-hamiltonian conjecture
• Domination of cyclic monotone \((s,t)\)-graphs
• On the circuit diameter conjecture
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
• scientific article; zbMATH DE number 4008435 (Why is no real title available?)
• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• Generation and properties of snarks
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• On dominating even subgraphs in cubic graphs
• Stable dominating circuits in snarks
• How many conjectures can you stand? A survey
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs

This page was built for publication: A note about the dominating circuit conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861225)