✦ LIBER ✦

Straight-line drawings of outerplanar graphs in area

✍ Scribed by Fabrizio Frati

Book ID: 116374028
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 367 KB
Volume: 45
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.03.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Outerplanarity of line graphs and iterat

Outerplanarity of line graphs and iterated line graphs

✍ Huiqiu Lin; Weihua Yang; Hailiang Zhang; Jinlong Shu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Straight-Line Drawing Algorithms for Hie

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

✍ Peter Eades; Qingwen Feng; Xuemin Lin; Hiroshi Nagamochi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 422 KB

Small Drawings of Outerplanar Graphs, Se

Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs

✍ Therese Biedl 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 618 KB

An Algorithm for Straight-Line Drawing o

An Algorithm for Straight-Line Drawing of Planar Graphs

✍ D. Harel; M. Sardas 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 200 KB

3D straight-line grid drawing of 4-color

3D straight-line grid drawing of 4-colorable graphs

✍ Tiziana Calamoneri; Andrea Sterbini 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 438 KB

In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in 0( n\*) volume. Moreover, we prove that each bipartite graph needs at least a( n3/\*) volume. @

A Linear Time Algorithm for Constructing

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs

✍ Seok-Hee Hong; Brendan McKay; Peter Eades 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 300 KB