On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1998.1869 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081273953 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5786239 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bemerkungen zum Vierfarbenproblem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09: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
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
