Convex dominating sets in maximal outerplanar graphs
DOI10.1016/J.DAM.2019.02.029zbMATH Open1416.05213OpenAlexW2937917427MaRDI QIDQ2312656FDOQ2312656
Authors: E. Rivera-Campo, Radosław Ziemann, Rita Zuazua, Paweł Żyliński, Magdalena Lemańska 
Publication date: 17 July 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.029
Recommendations
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Distance domination, guarding and covering of maximal outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- A short proof of Chvatal's Watchman Theorem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Approximation algorithms for NP-complete problems on planar graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- The number of caterpillars
- Monitoring maximal outerplanar graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Practical algorithms on partial k-trees with an application to domination-like problems
- A combinatorial theorem in plane geometry
- The complexity of first-order and monadic second-order logic revisited
- Dominating sets in planar graphs
- Flips in planar graphs
- Constructing connected bicritical graphs with edge-connectivity 2
- Title not available (Why is that?)
- Enumerating pseudo-triangulations in the plane
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Linear-time computation of optimal subgraphs of decomposable graphs
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- Distance domination, guarding and covering of maximal outerplanar graphs
- Title not available (Why is that?)
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Edge criticality in secure graph domination
- Total domination in maximal outerplanar graphs. II.
- Graphs with convex domination number close to their order
- Flipping edge-labelled triangulations
- On the secure domination numbers of maximal outerplanar graphs
- Flip distance between two triangulations of a point set is NP-complete
- Total dominating sets in maximal outerplanar graphs
- Flip distance between triangulations of a simple polygon is NP-complete
- Computing the flip distance between triangulations
- Convex domination in the composition and Cartesian product of graphs.
- Nordhaus-Gaddum results for the convex domination number of a graph
- Title not available (Why is that?)
- The convex domination subdivision number of a graph
- Weakly convex and convex domination numbers of some products of graphs.
- Influence of edge subdivision on the convex domination number
- Title not available (Why is that?)
- A proof of the orbit conjecture for flipping edge-labelled triangulations
Cited In (5)
This page was built for publication: Convex dominating sets in maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312656)
