Routing sets in the integer lattice

DOI10.1016/J.DAM.2007.02.007MaRDI QIDQ997064zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the general routing polytope
• Publication:3210199
• Publication:4944978
• Routing by matching on convex pieces of grid graphs
• Routing in graphs
• Routing numbers of cycles, complete bipartite graphs, and hypercubes
• An axiomatic approach to routing
• The Compactness of Interval Routing

Cites work

• scientific article; zbMATH DE number 4104992 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 734463 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1778131 (Why is no real title available?)
• scientific article; zbMATH DE number 5030278 (Why is no real title available?)
• Fault-tolerant locating-dominating sets

Cited in

(5)

• The hub number of co-comparability graphs
• Planar lattice subsets with minimal vertex boundary
• The hub number of a graph
• The hub number, girth and Mycielski graphs
• Routes enumeration in a Boolean with respect to intersection and nonintersection relations

This page was built for publication: Routing sets in the integer lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997064)