A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs

DOI10.1016/j.disc.2007.09.051zbMath1186.05093OpenAlexW2179924962WikidataQ122977347 ScholiaQ122977347MaRDI QIDQ998464

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

zbMATH Keywords

cubic graphsessentially 4-edge-connecteddominating circuit conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (3)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ How many conjectures can you stand? A survey ⋮ Equivalence of Jackson's and Thomassen's conjectures

Cites Work

• Unnamed Item
• Unnamed Item
• Recharacterizing Eulerian: Intimations of new duality
• On a closure concept in claw-free graphs
• Equivalence of Fleischner's and Thomassen's conjectures
• A note about the dominating circuit conjecture
• Reflections on graph theory

This page was built for publication: A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs