On domination in 2-connected cubic graphs

zbMath1159.05043MaRDI QIDQ1010698

B. Y. Stodolsky

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129771

zbMATH Keywords

cubic graphsdomination number

Mathematics Subject Classification ID

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

Related Items (2)

Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs ⋮ An upper bound on the domination number of \(n\)-vertex connected cubic graphs

This page was built for publication: On domination in 2-connected cubic graphs