A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
DOI10.1016/J.DISC.2007.09.051zbMATH Open1186.05093OpenAlexW2179924962WikidataQ122977347 ScholiaQ122977347MaRDI QIDQ998464FDOQ998464
Authors: Roman Kužel 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.051
Recommendations
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
- On dominating even subgraphs in cubic graphs
- On domination in connected cubic graphs
- On domination in 2-connected cubic graphs
- Existence of efficient total dominating sets of circulant graphs of degree 4
- Some remarks on domination in cubic graphs
- A new bound on the domination number of connected cubic graphs
- A note about the dominating circuit conjecture
- A tight bound for independent domination of cubic graphs without 4‐cycles
- A note on domination and minus domination numbers in cubic graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
Cited In (7)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- How many conjectures can you stand? A survey
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Equivalence of Jackson's and Thomassen's conjectures
- A note about the dominating circuit conjecture
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
This page was built for publication: A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998464)
