Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
From MaRDI portal
(Redirected from Publication:510554)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Distance domination, guarding and covering of maximal outerplanar graphs
- Dominating sets in planar graphs
- Dominating sets of maximal outerplanar graphs
- Dominating sets whose closed stars form spanning trees
- On dominating sets of maximal outerplanar graphs
- Semitotal domination in graphs
- Total domination in maximal outerplanar graphs. II.
Cited in
(13)- Total domination in plane triangulations
- Connected domination in maximal outerplanar graphs
- Monitoring maximal outerplanar graphs
- Combinatorial bounds on paired and multiple domination in triangulations
- Semipaired domination in maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- Bounds for the connected domination number of maximal outerplanar graphs
- Partial domination of maximal outerplanar graphs
- On dominating sets of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- An upper bound on the algebraic connectivity of outerplanar graphs
- Convex dominating sets in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs
This page was built for publication: Combinatorial bounds on connectivity for 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 Q510554)