A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
From MaRDI portal
Publication:998464
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
Cites work
- scientific article; zbMATH DE number 4108816 (Why is no real title available?)
- A note about the dominating circuit conjecture
- Equivalence of Fleischner's and Thomassen's conjectures
- Graph theory
- On a closure concept in claw-free graphs
- Recharacterizing Eulerian: Intimations of new duality
- Reflections on graph theory
Cited in
(8)- How many conjectures can you stand? A survey
- A note about the dominating circuit conjecture
- Equivalence of Jackson's and Thomassen's conjectures
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
- On dominating even subgraphs in cubic graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
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)