✦ LIBER ✦

On the bandwidth of triangulated triangles

✍ Scribed by Robert Hochberg; Colin McDiarmid; Michael Saks

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 210 KB
Volume: 138
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00208-z

No coin nor oath required. For personal study only.

✦ Synopsis

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 1, the triangulated triangle T~ with side-length 1 has bandwidth exactly I + 1. This settles a question of Douglas West.

📜 SIMILAR VOLUMES

On the Interval Number of a Triangulated

On the Interval Number of a Triangulated Graph

✍ Thomas Andreae 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB 👁 2 views

The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect

On the Number of Primitive Pythagorean T

On the Number of Primitive Pythagorean Triangles

✍ Hartmut Menzer 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

Interpolation on the triangle

✍ Lee, S. L. ;Phillips, G. M. 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 219 KB

The optimum design of triangulated frame

The optimum design of triangulated frameworks

✍ A.R. Toakley 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 754 KB

On the effects of triangulated terrain r

On the effects of triangulated terrain resolution on distributed hydrologic model response

✍ Enrique R. Vivoni; Valeriy Y. Ivanov; Rafael L. Bras; Dara Entekhabi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 793 KB

Distributed hydrologic models based on triangulated irregular networks (TIN) provide a means for computational efficiency in small to large-scale watershed modelling through an adaptive, multiple resolution representation of complex basin topography. Despite previous research with TIN-based hydrolog

On the max-cut problem for a planar, cub

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation

✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24 − 7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example