Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs
From MaRDI portal
(Redirected from Publication:494436)
Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- Covering and guarding polygons using \(L_ k\)-sets
- Distance domination, guarding and covering of maximal outerplanar graphs
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
Cited in
(7)- Vertex cover at distance on \(H\)-free graphs
- Total dominating sets in maximal outerplanar graphs
- Bounds on the exponential domination number
- Isolation of \(k\)-cliques
- Convex dominating sets in maximal outerplanar graphs
- Exponential domination in subcubic graphs
- Distance domination, guarding and covering of maximal outerplanar graphs
This page was built for publication: Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494436)