Efficient domination in grid graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4057564
- Classification of efficient dominating sets of circulant graphs of degree 5
- scientific article; zbMATH DE number 4085682
- Weighted efficient domination problem on some perfect graphs
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
Cites work
- Computing the domination number of grid graphs
- Constructing \(\gamma\)-sets of grids
- Domination in Graphs: Core Concepts
- scientific article; zbMATH DE number 4008448 (Why is no real title available?)
- scientific article; zbMATH DE number 734463 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- The domination number of grids
- The domination numbers of the 5 × n and 6 × n grid graphs
Cited in
(3)
This page was built for publication: Efficient domination in grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625100)