On 2-limited packings of complete grid graphs
From MaRDI portal
Publication:526269
DOI10.1016/J.DISC.2016.11.001zbMATH Open1361.05099OpenAlexW2550083616MaRDI QIDQ526269FDOQ526269
Authors: Nancy E. Clarke, Robert P. Gallant
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.11.001
Recommendations
- scientific article; zbMATH DE number 554182
- Limited Packings in Graphs
- Limited packings in graphs
- On the multipacking number of grid graphs
- Total limited packing in graphs
- On Two Conjectures on Packing of Graphs
- Packings in complete graphs
- scientific article; zbMATH DE number 4039955
- On the \(k\)-limited packing numbers in graphs
- On the number of 2-packings in a connected graph
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Limited packings in graphs
- Title not available (Why is that?)
- The domination number of grids
- The multiple domination and limited packing problems in graphs
- The probabilistic approach to limited packings in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- Automated bounds on recursive structures
Cited In (4)
This page was built for publication: On 2-limited packings of complete grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526269)