On the bandwidth of triangulated triangles (Q1842168): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00208-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091052948 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the bandwidth of triangulated triangles |
scientific article |
Statements
On the bandwidth of triangulated triangles (English)
0 references
23 October 1995
0 references
The three authors give a technique for obtaining a lower bound on the bandwidth of any planar graph \(G\) by proving that if \(G\) is a plane near- triangulation and \(v_ 1\), \(v_ 2\), \(v_ 3\) are three mutually distinct vertices on the exterior face, the bandwidth of \(G\) is at least as large as the smallest connecting set with respect to \(v_ 1\), \(v_ 2\), \(v_ 3\).
0 references
triangulated triangles
0 references
bandwidth
0 references
planar graph
0 references
