Combinatorial bounds on paired and multiple domination in triangulations

DOI10.1016/j.endm.2018.06.014zbMath1397.05125OpenAlexW2884941071WikidataQ129518103 ScholiaQ129518103MaRDI QIDQ1792065

Santiago Canales, Irene Castro, Gregorio Hernández

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.06.014

zbMATH Keywords

triangulationdominationmaximal outerplanar graph

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) Connectivity (05C40)

Related Items (1)

Total domination in plane triangulations

Cites Work

• Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
• Total domination in maximal outerplanar graphs. II.
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• Dominating sets in planar graphs
• Dominating sets of maximal outerplanar graphs
• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial bounds on paired and multiple domination in triangulations