On the bandwidth of triangulated triangles (Q1842168): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal labelling of a product of two paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3789621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138968 / rank | |||
Normal rank |
Revision as of 13:06, 23 May 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