Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs

DOI10.1016/j.dam.2015.05.010zbMath1319.05097OpenAlexW2244026998MaRDI QIDQ494436

Dieter Rautenbach, José D. Alvarado, 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

zbMATH Keywords

distancedominationvertex coverguardingmaximal outerplanar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Total dominating sets in maximal outerplanar graphs ⋮ Isolation of \(k\)-cliques ⋮ Exponential domination in subcubic graphs ⋮ Bounds on the exponential domination number ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Vertex cover at distance on \(H\)-free graphs

Cites Work

• Distance domination, guarding and covering of maximal outerplanar graphs
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Covering and guarding polygons using \(L_ k\)-sets
• Unnamed Item

This page was built for publication: Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs