On 2-limited packings of complete grid graphs

DOI10.1016/j.disc.2016.11.001zbMath1361.05099OpenAlexW2550083616MaRDI QIDQ526269

Robert P. Gallant, Nancy E. Clarke

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

zbMATH Keywords

Cartesian productgrid graphgraph packingbox product2-limited packing

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Labelled packing functions in graphs

Cites Work

• Limited packings in graphs
• 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
• The Domination Number of Grids
• Unnamed Item
• Unnamed Item

This page was built for publication: On 2-limited packings of complete grid graphs