A new bound on the domination number of connected cubic graphs
From MaRDI portal
Publication:2454559
zbMATH Open1299.05252MaRDI QIDQ2454559FDOQ2454559
Authors: Christopher J. Stocker, Alexandr Kostochka 
Publication date: 13 June 2014
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: http://semr.math.nsc.ru/v6/p465-504.pdf
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cited In (21)
- My favorite domination conjectures in graph theory are bounded
- Best possible upper bounds on the restrained domination number of cubic graphs
- Minimum maximal matchings in cubic graphs
- Domination of triangulated discs and maximal outerplanar graphs
- Decreasing the maximum degree of a graph
- Eternal and Secure Domination in Graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- On (1,2)-domination in cubic graphs
- On domination in connected cubic graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- On \(k\)-domination and \(j\)-independence in graphs
- Partial domination in supercubic graphs
- Bounds on domination parameters in graphs: a brief survey
- Independent domination in cubic graphs
- The domination number of cubic Hamiltonian graphs
- Vertex-edge domination in cubic graphs
- On domination in 2-connected cubic graphs
- Dominating vertex covers: the vertex-edge domination problem
- Domination number of cubic graphs with large girth
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
- Domination versus disjunctive domination in graphs
This page was built for publication: A new bound on the domination number of connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454559)
