New bounds on the edge-bandwidth of triangular grids
From MaRDI portal
Publication:5245726
DOI10.1051/ita/2014027zbMath1314.05177MaRDI QIDQ5245726
Publication date: 15 April 2015
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2014027
90C47: Minimax problems in mathematical programming
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Cutwidth of triangular grids
- Edge-bandwidth of grids and tori
- Edge-bandwidth of the triangular grid
- Optimal labelling of a product of two paths
- On the bandwidth of triangulated triangles
- New results on edge-bandwidth
- On the edge-bandwidth of graph products
- Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
- The bandwidth problem for graphs and matrices—a survey
- Edge-Bandwidth of Graphs
- Optimal numberings and isoperimetric problems on graphs