New results on edge-bandwidth
From MaRDI portal
Publication:1885045
DOI10.1016/S0304-3975(03)00234-2zbMath1070.68115MaRDI QIDQ1885045
Imrich Vrt'o, Tiziana Calamoneri, Annalisa Massini
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Edge-bandwidth of grids and tori ⋮ On the edge-bandwidth of graph products ⋮ On explicit formulas for bandwidth and antibandwidth of hypercubes ⋮ New bounds on the edge-bandwidth of triangular grids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On edge numberings of the \(n\)-cube graph
- A lower bound on the size of a complex generated by an antichain
- Minimum range sequences of all k-subsets of a set
- On the bandwidth of convex triangulation meshes
- Bounding the bandwidths for graphs
- On the bandwidth of triangulated triangles
- Bandwidth of the complete \(k\)-ary tree
- The bandwidth problem for graphs and matrices—a survey
- On bandwidth, cutwidth, and quotient graphs
- Edge-Bandwidth of Graphs
- Optimal numberings and isoperimetric problems on graphs
This page was built for publication: New results on edge-bandwidth
