A note about the dominating circuit conjecture

DOI10.1016/S0012-365X(02)00588-5zbMath1015.05062OpenAlexW2022070925WikidataQ122943808 ScholiaQ122943808MaRDI QIDQ1861225

Herbert Fleischner, Martin Kochol

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00588-5

Mathematics Subject Classification ID

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

Related Items (6)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Generation and properties of snarks ⋮ How many conjectures can you stand? A survey ⋮ A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs

This page was built for publication: A note about the dominating circuit conjecture