Total domination in plane triangulations
From MaRDI portal
Publication:2219969
DOI10.1016/j.disc.2020.112179zbMath1455.05054arXiv2011.04255OpenAlexW3093325855MaRDI QIDQ2219969
Mercè Claverol, Carmen Hernando, Mercè Mora, Gregorio Hernández, Montserrat Maureso, Alfredo Daniel Garcia, F. Javier Tejel
Publication date: 21 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.04255
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Dominating plane triangulations
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs
- Dominating sets in plane triangulations
- Total domination in maximal outerplanar graphs. II.
- A survey of selected recent results on total domination in graphs
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- A short proof of Chvatal's Watchman Theorem
- Combinatorial bounds on paired and multiple domination in triangulations
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- The domination number of plane triangulations
- Convex dominating sets in maximal outerplanar graphs
- Semipaired domination in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Covering and guarding polygons using \(L_ k\)-sets
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Total Domination in Graphs
This page was built for publication: Total domination in plane triangulations