✦ LIBER ✦

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Scribed by Jim Geelen; Anjie Guo; David McKinnon

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 87 KB
Volume: 58
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20304

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008

📜 SIMILAR VOLUMES

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