Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs
DOI10.1016/j.dam.2015.05.029zbMath1319.05102OpenAlexW618046621WikidataQ123197360 ScholiaQ123197360MaRDI QIDQ494435
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.029
triangulationdomination numberouterplanar graph\(K_{2, 3}\)-minor free graph\(K_4\)-minor free graph
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Cites Work
- Unnamed Item
- Dominating sets in plane triangulations
- Connectivity of plane triangulations
- On domination in 2-connected cubic graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- On domination in connected cubic graphs
- Connectivity of Planar Graphs
- Bounds of spectral radii of K_{2,3}-minor free graphs
- A Theorem on Planar Graphs
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
This page was built for publication: Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs