Total dominating sets in maximal outerplanar graphs
From MaRDI portal
Publication:2409534
DOI10.1007/s00373-017-1802-7zbMath1373.05144OpenAlexW2619043634MaRDI QIDQ2409534
Rita E. Zuazua, Paweł Żyliński, Magdalena Lemańska
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1802-7
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)
Related Items (9)
Partial domination of maximal outerplanar graphs ⋮ Extensions of the Art Gallery Theorem ⋮ Total domination in plane triangulations ⋮ Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ Domination and outer connected domination in maximal outerplanar graphs ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Isolation number of maximal outerplanar graphs ⋮ Double domination in maximal outerplanar graphs ⋮ Semipaired domination in maximal outerplanar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Monitoring maximal outerplanar graphs
- Distance domination, guarding and covering of maximal outerplanar graphs
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- A combinatorial theorem in plane geometry
- Art gallery theorems for guarded guards.
- Watched guards in art galleries
This page was built for publication: Total dominating sets in maximal outerplanar graphs