On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zum Vierfarbenproblem / rank
 
Normal rank

Latest revision as of 08:30, 29 May 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
    0 references
    0 references
    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

    Identifiers