Disjunctive domination in maximal outerplanar graphs
From MaRDI portal
Cites work
- A combinatorial theorem in plane geometry
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Disjunctive domination in graphs with minimum degree at least two
- Dominating sets inducing large components in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Domination in Graphs: Core Concepts
- Domination versus disjunctive domination in graphs
- Domination versus disjunctive domination in trees
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- On dominating sets of maximal outerplanar graphs
- On the secure domination numbers of maximal outerplanar graphs
- Secure total domination number in maximal outerplanar graphs
- Structures of domination in graphs
- The disjunctive domination number of a graph
- Topics in Domination in Graphs
- Total dominating sets in maximal outerplanar graphs
- Total domination in graphs
- Total domination in maximal outerplanar graphs. II.
This page was built for publication: Disjunctive domination in maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842207)