Monitoring maximal outerplanar graphs

DOI10.1016/J.ENDM.2014.08.020MaRDI QIDQ283691zbMATH OpenOpenAlexFDO

Authors Gregorio Hernández, Mafalda Martins

Publication date 13 May 2016

Full work available at URL http://hdl.handle.net/10773/22208

zbMATH Keywords

coveringdominationguardingtriangulation graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Distance domination, guarding and covering of maximal outerplanar graphs
• Complexity of edge monitoring on some graph classes
• scientific article; zbMATH DE number 3857141
• scientific article; zbMATH DE number 3875306
• Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs

Cites work

• A short proof of Chvatal's Watchman Theorem
• Dominating sets of maximal outerplanar graphs
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• On dominating sets of maximal outerplanar graphs

Cited in

(2)

• Convex dominating sets in maximal outerplanar graphs
• Total dominating sets in maximal outerplanar graphs

This page was built for publication: Monitoring maximal outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283691)