Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs
DOI10.1016/J.DAM.2015.05.010zbMATH Open1319.05097OpenAlexW2244026998MaRDI QIDQ494436FDOQ494436
Authors: José D. Alvarado, Dieter Rautenbach, Simone Dantas 
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.010
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- A short proof of Chvatal's Watchman Theorem
- On dominating sets of maximal outerplanar graphs
- A combinatorial theorem in plane geometry
- Dominating sets in planar graphs
- Covering and guarding polygons using \(L_ k\)-sets
- Distance domination, guarding and covering of maximal outerplanar graphs
Cited In (7)
- Vertex cover at distance on \(H\)-free graphs
- Isolation of \(k\)-cliques
- Distance domination, guarding and covering of maximal outerplanar graphs
- Exponential domination in subcubic graphs
- Bounds on the exponential domination number
- Convex dominating sets in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
This page was built for publication: Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494436)
