Total domination in maximal outerplanar graphs. II.
From MaRDI portal
(Redirected from Publication:897314)
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- Dominating sets in planar graphs
- Dominating sets of maximal outerplanar graphs
- Domination numbers of planar graphs
- Graphs \& digraphs
- On dominating sets of maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
Cited in
(28)- Partial domination of maximal outerplanar graphs
- Isolation of regular graphs and \(k\)-chromatic graphs
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- A note on the double domination number in maximal outerplanar and planar graphs
- Semipaired domination in maximal outerplanar graphs
- On dominating sets of maximal outerplanar graphs
- Double domination in maximal outerplanar graphs
- 3-component domination numbers in graphs
- Secure total domination number in maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- Domination and outer connected domination in maximal outerplanar graphs
- Isolation of squares in graphs
- On dominating sets of maximal outerplanar and planar graphs
- Combinatorial bounds on paired and multiple domination in triangulations
- Total dominating sets in maximal outerplanar graphs
- Connected domination in maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
- Convex dominating sets in maximal outerplanar graphs
- Total domination in plane triangulations
- On the secure domination numbers of maximal outerplanar graphs
- Total domination in maximal outerplanar graphs
- Independent domination in outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
- Dominating sets inducing large component in graphs with minimum degree two
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Dominating sets inducing large components
- Isolation number of maximal outerplanar graphs
This page was built for publication: Total domination in maximal outerplanar graphs. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897314)