✦ LIBER ✦

Planar Graphs, via Well-Orderly Maps and Trees

✍ Scribed by Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Dominique Poulalhon; Gilles Schaeffer

Book ID: 106047595
Publisher: Springer Japan
Year: 2006
Tongue: English
Weight: 256 KB
Volume: 22
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-006-0647-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing trees into planar graphs

✍ A. García; C. Hernando; F. Hurtado; M. Noy; J. Tejel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract In this study, we provide methods for drawing a tree with __n__ vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Grap

Identifying Codes in Trees and Planar Gr

Identifying Codes in Trees and Planar Graphs

✍ David Auger 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Short encodings of planar graphs and map

Short encodings of planar graphs and maps

✍ Kenneth Keeler; Jeffery Westbrook 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 996 KB

Parallel recognition algorithms for chor

Parallel recognition algorithms for chordal_planar graphs and planar -trees

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Two trees in maximal planar bipartite gr

Two trees in maximal planar bipartite graphs

✍ Gerhard Ringel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

Statistics of planar graphs viewed from

Statistics of planar graphs viewed from a vertex: a study via labeled trees

✍ J. Bouttier; P. Di Francesco; E. Guitter 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 636 KB