Acute triangles in 4-connected maximal plane graphs

Ken Ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)95-106
Number of pages12
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 2005 Mar 28


  • 4-Connected maximal plane graphs
  • Acute triangles
  • Contractions
  • Straight-line embeddings

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Acute triangles in 4-connected maximal plane graphs'. Together they form a unique fingerprint.

Cite this