On independent domination in planar cubic graphs
From MaRDI portal
Publication:2312063
DOI10.7151/dmgt.2105zbMath1415.05127OpenAlexW2805599219MaRDI QIDQ2312063
Michael A. Henning, G. Abrishami, Freydoon Rahbarnia
Publication date: 4 July 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2105
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Independent domination, colorings and the fractional idomatic number of a graph ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
- Unnamed Item
- Unnamed Item
- Domination versus independent domination in cubic graphs
- A note on independent sets in graphs with large minimum degree and small cliques
- Independent dominating sets in triangle-free graphs
- Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- Independent domination in subcubic bipartite graphs of girth at least six
- What is the difference between the domination and independent domination numbers of a cubic graph?
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- Independent Domination in Cubic Graphs
This page was built for publication: On independent domination in planar cubic graphs
