Routing sets in the integer lattice

DOI10.1016/j.dam.2007.02.007zbMath1119.05088OpenAlexW1980795137MaRDI QIDQ997064

Peter Hamburger, Matt Walsh, Robert C. Vandell

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.007

zbMATH Keywords

grid graphsconnected domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The hub number of a graph ⋮ The hub number, girth and Mycielski graphs ⋮ The hub number of co-comparability graphs

Cites Work

• Fault-tolerant locating-dominating sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item