On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:52, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of acute triangles in a straight-line embedding of a maximal planar graph |
scientific article |
Statements
On the number of acute triangles in a straight-line embedding of a maximal planar graph (English)
0 references
16 February 2000
0 references
We show that any maximal planar graph with \(m\) triangles except the unbounded face can be transformed into a straight-line embedding in which at least \(\lceil m/3\rceil\) triangles are acute triangles. Moreover, we show that any maximal outer-planar graph can be transformed into a straight-line embedding in which all faces are acute triangles except the unbounded face. \(\copyright\) Academic Press.
0 references
maximal planar graph
0 references
straight-line embedding
0 references
acute triangles
0 references
