✦ LIBER ✦

On the number of lines in planar spaces

✍ Scribed by Klaus Metsch

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 269 KB
Volume: 15
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01294462

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Balanced Lines

✍ J. Pach; R. Pinchasi 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 119 KB

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

On configuration spaces of planar pentag

On configuration spaces of planar pentagons

✍ V. E. Bening 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 168 KB

On configuration spaces of planar pentag

On configuration spaces of planar pentagons

✍ G. Khimshiashvili 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 133 KB

On the Roman Bondage Number of Planar Gr

On the Roman Bondage Number of Planar Graphs

✍ Nader Jafari Rad; Lutz Volkmann 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 143 KB

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib