On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of acute triangles in a straight-line embedding of a maximal planar graph |
scientific article; zbMATH DE number 1347241
| 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; zbMATH DE number 1347241 |
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
0.8951609
0 references
0.8772391
0 references
0.8717202
0 references
0.87027913
0 references
0.86900705
0 references
0.8649125
0 references
0.8648919
0 references
0.8646568
0 references
0.86162317
0 references
