Distance domination, guarding and covering of maximal outerplanar graphs

DOI10.1016/J.DAM.2014.08.040MaRDI QIDQ479016zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• \(K\)-vertex guarding simple polygons
• A note on distance domination numbers of graphs
• A short proof of Chvatal's Watchman Theorem
• Bounds for distance domination numbers of graphs
• Bounds on the distance two-domination number of a graph
• Broadcast covers in graphs
• Covering and guarding polygons using \(L_ k\)-sets
• Dominating sets in planar graphs
• Dominating sets in plane triangulations
• Dominating sets of maximal outerplanar graphs
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• Guarding polyhedral terrains
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• On dominating sets of maximal outerplanar graphs
• Relations between packing and covering numbers of a tree

Cited in

(13)

• Vertex cover at distance on \(H\)-free graphs
• Isolation of \(k\)-cliques
• Convex dominating sets in maximal outerplanar graphs
• Total dominating sets in maximal outerplanar graphs
• Extensions of the Art Gallery Theorem
• Monitoring maximal outerplanar graphs
• 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
• Disjoint isolating sets and graphs with maximum isolation number
• Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
• Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
• Bounds on the exponential domination number

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)