Domination of maximal K₄-minor free graphs and maximal K₂, 3-minor free graphs, and disproofs of two conjectures on planar graphs
DOI10.1016/J.DAM.2015.05.029zbMATH Open1319.05102OpenAlexW618046621WikidataQ123197360 ScholiaQ123197360MaRDI QIDQ494435FDOQ494435
Authors: Tingting Zhu, Baoyindureng Wu 
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
Recommendations
- On dominating sets of maximal outerplanar and planar graphs
- Total domination in maximal outerplanar graphs
- Dominating maximal outerplane graphs and Hamiltonian plane triangulations
- Domination and outer connected domination in maximal outerplanar graphs
- A note on domination number in maximal outerplanar graphs
domination numbertriangulationouterplanar graph\(K_{2, 3}\)-minor free graph\(K_4\)-minor free graph
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)
Cites Work
- Graph theory
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- A Theorem on Planar Graphs
- Dominating sets in planar graphs
- Dominating sets in plane triangulations
- On domination in connected cubic graphs
- On domination in 2-connected cubic graphs
- Connectivity of planar graphs
- Bounds of spectral radii of K_{2,3}-minor free graphs
- Connectivity of plane triangulations
Cited In (3)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494435)
