𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximizing maximal angles for plane straight-line graphs

✍ Scribed by Oswin Aichholzer; Thomas Hackl; Michael Hoffmann; Clemens Huemer; Attila Pór; Francisco Santos; Bettina Speckmann; Birgit Vogtenhuber

Book ID
119220211
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
376 KB
Volume
46
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iterated line graphs are maximally order
Iterated line graphs are maximally ordered
✍ Martin Knor; L'udovít Niepel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract A graph __G__ is __k__‐ordered if for every ordered sequence of __k__ vertices, there is a cycle in __G__ that encounters the vertices of the sequence in the given order. We prove that if __G__ is a connected graph distinct from a path, then there is a number __t~G~__ such that for ever

On the Number of Acute Triangles in a St
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph
✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 80 KB

In this paper 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 WmÂ3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi