Edge-bandwidth of grids and tori

DOI10.1016/j.tcs.2006.06.018zbMath1110.68113OpenAlexW2168747456MaRDI QIDQ861250

Oleg Pikhurko, Jerzy Wojciechowski

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.018

zbMATH Keywords

gridsgraph productsedge bandwidth

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Bandwidth and pathwidth of three-dimensional grids ⋮ New bounds on the edge-bandwidth of triangular grids ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal labelling of a product of two paths
• Minimum range sequences of all k-subsets of a set
• Graph searching, elimination trees, and a generalization of bandwidth
• Minimum \(k\) arborescences with bandwidth constraints
• New results on edge-bandwidth
• On the edge-bandwidth of graph products
• Isoperimetric Inequalities and the Width Parameters of Graphs
• The bandwidth problem for graphs and matrices—a survey
• Routing and Admission Control in General Topology Networks with Poisson Arrivals
• Index assignment for multichannel communication under failure
• Edge-Bandwidth of Graphs
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Edge-bandwidth of grids and tori