A new bound on the domination number of connected cubic graphs

zbMath1299.05252MaRDI QIDQ2454559

Christopher Stocker, Alexandr V. Kostochka

Publication date: 13 June 2014

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v6/p465-504.pdf

zbMATH Keywords

cubic graphdominationconnected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (10)

Minimum maximal matchings in cubic graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Independent Domination in Cubic Graphs ⋮ Decreasing the maximum degree of a graph ⋮ Partial domination in supercubic graphs ⋮ Dominating vertex covers: the vertex-edge domination problem ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Domination versus disjunctive domination in graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded

This page was built for publication: A new bound on the domination number of connected cubic graphs