Distance domination, guarding and covering of maximal outerplanar graphs
DOI10.1016/J.DAM.2014.08.040zbMATH Open1304.05022OpenAlexW2069917337MaRDI QIDQ479016FDOQ479016
Authors: Santiago Canales, Gregorio Hernández, Mafalda Martins, Inês Matos 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.040
Recommendations
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- On the secure domination numbers of maximal outerplanar graphs
- On dominating sets of maximal outerplanar graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- A short proof of Chvatal's Watchman Theorem
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Relations between packing and covering numbers of a tree
- Title not available (Why is that?)
- Dominating sets in planar graphs
- Dominating sets in plane triangulations
- Guarding polyhedral terrains
- Bounds for distance domination numbers of graphs
- \(K\)-vertex guarding simple polygons
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- Bounds on the distance two-domination number of a graph
- Covering and guarding polygons using \(L_ k\)-sets
- Broadcast covers in graphs
- A note on distance domination numbers of graphs
Cited In (11)
- Vertex cover at distance on \(H\)-free graphs
- Monitoring maximal outerplanar graphs
- Disjoint isolating sets and graphs with maximum isolation number
- Extensions of the Art Gallery Theorem
- Isolation of \(k\)-cliques
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Exponential domination in subcubic graphs
- Bounds on the exponential domination number
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Convex dominating sets in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
This page was built for publication: Distance domination, guarding and covering of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479016)
