TY - JOUR
T1 - On the bandwidth of triangulated triangles
AU - Hochberg, Robert
AU - McDiarmid, Colin
AU - Saks, Michael
N1 - Funding Information:
" This work supported in part by NSF under grant CCR-9215293 and D1MACS. *Corresponding author
PY - 1995/3/6
Y1 - 1995/3/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0013464336&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0013464336&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(94)00208-Z
DO - 10.1016/0012-365X(94)00208-Z
M3 - Article
AN - SCOPUS:0013464336
VL - 138
SP - 261
EP - 265
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
IS - 1-3
ER -