A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
From MaRDI portal
Publication:998464
DOI10.1016/j.disc.2007.09.051zbMath1186.05093OpenAlexW2179924962WikidataQ122977347 ScholiaQ122977347MaRDI QIDQ998464
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
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items
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