Domination and outer connected domination in maximal outerplanar graphs
From MaRDI portal
Publication:2053729
DOI10.1007/s00373-021-02383-wzbMath1479.05292OpenAlexW3184799087MaRDI QIDQ2053729
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02383-w
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the outer-connected domination in 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
- Total domination in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
- A short proof of Chvatal's Watchman Theorem
- On the secure domination numbers of maximal outerplanar graphs
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- Partial domination of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Semipaired domination in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
This page was built for publication: Domination and outer connected domination in maximal outerplanar graphs