Monitoring maximal outerplanar graphs

DOI10.1016/j.endm.2014.08.020zbMath1338.05199OpenAlexW2010061919MaRDI QIDQ283691

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

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• A short proof of Chvatal's Watchman Theorem
• On dominating sets of maximal outerplanar graphs
• Dominating sets of maximal outerplanar graphs

This page was built for publication: Monitoring maximal outerplanar graphs