1. An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
2. The bandwidth of a tree with k leaves is at most [k2]
3. [BaRuSl92] M. E. Bascuñán, S. Ruiz, and P. J. Slater, The additive bandwidth of grids and complete bipartite graphs, Congressus Numerantium 88 (1992), 245-254.