Distance domination, guarding and covering of maximal outerplanar graphs

DOI10.1016/j.dam.2014.08.040zbMath1304.05022OpenAlexW2069917337MaRDI QIDQ479016

Mafalda Martins, Santiago Canales, Gregorio Hernández, 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

zbMATH Keywords

coveringdominationguardingtriangulation graphs

Mathematics Subject Classification ID

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

Related Items (8)

Total dominating sets in maximal outerplanar graphs ⋮ Isolation of \(k\)-cliques ⋮ Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs ⋮ Exponential domination in subcubic graphs ⋮ Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs ⋮ Bounds on the exponential domination number ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Vertex cover at distance on \(H\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guarding polyhedral terrains
• Dominating sets in plane triangulations
• \(K\)-vertex guarding simple polygons
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• Relations between packing and covering numbers of a tree
• A short proof of Chvatal's Watchman Theorem
• Bounds on the distance two-domination number of a graph
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Dominating sets of maximal outerplanar graphs
• Covering and guarding polygons using \(L_ k\)-sets

This page was built for publication: Distance domination, guarding and covering of maximal outerplanar graphs