The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs

DOI10.1016/J.ENDM.2006.06.017MaRDI QIDQ3439419zbMATH OpenOpenAlexWikidataFDO

Authors Roman Kužel

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.017

zbMATH Keywords

4-edge-connectedcubicdominating circutit conjectureessentiallygraphs

Mathematics Subject Classification ID

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

Recommendations

• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
• A note about the dominating circuit conjecture
• Strong circuit double cover of some cubic graphs
• Cycles through four edges in 3-connected cubic graphs
• On dominating even subgraphs in cubic graphs

Cites work

• A note about the dominating circuit conjecture
• Equivalence of Fleischner's and Thomassen's conjectures
• Graph theory with applications
• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• On a closure concept in claw-free graphs
• Recharacterizing Eulerian: Intimations of new duality
• Reflections on graph theory

Cited in

(4)

• A note about the dominating circuit conjecture
• On dominating even subgraphs in cubic graphs
• The acircuitic directed star arboricity of subcubic graphs is at most four
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs

This page was built for publication: 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 Q3439419)