On the bandwidth of triangulated triangles

Robert Hochberg; Colin McDiarmid; Michael Saks

doi:10.1016/0012-365X(94)00208-Z

On the bandwidth of triangulated triangles

Robert Hochberg, Colin McDiarmid, Michael Saks

School of Arts and Sciences, Mathematics

Research output: Contribution to journal › Article › peer-review

19 Scopus citations

Abstract

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 T_l with side-length l has bandwidth exactly l + 1. This settles a question of Douglas West.

Original language	English (US)
Pages (from-to)	261-265
Number of pages	5
Journal	Discrete Mathematics
Volume	138
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(94)00208-Z
State	Published - Mar 6 1995

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(94)00208-Z

Fingerprint Dive into the research topics of 'On the bandwidth of triangulated triangles'. Together they form a unique fingerprint.

Cite this

@article{628a7c15e22a482e9a649be2a1957038,

title = "On the bandwidth of triangulated triangles",

abstract = "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.",

author = "Robert Hochberg and Colin McDiarmid and Michael Saks",

year = "1995",

month = mar,

day = "6",

doi = "10.1016/0012-365X(94)00208-Z",

language = "English (US)",

volume = "138",

pages = "261--265",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On the bandwidth of triangulated triangles

AU - Hochberg, Robert

AU - McDiarmid, Colin

AU - Saks, Michael

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 -