We give a technique for obtaining a lower bound on the bandwidth of any planar graph with an embedding in which all bounded faces are triangles. This technique is applied to show that, for each positive integer l, the triangulated triangle Tl with side-length l has bandwidth exactly l + 1. This settles a question of Douglas West.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics