In this paper, we show that every 4-connected maximal plane graph with m finite faces other than the octahedron can be drawn in the plane so that at least (m+3)/2 faces are acute triangles. Moreover, this bound is sharp.
- 4-Connected maximal plane graphs
- Acute triangles
- Straight-line embeddings
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics