𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Straight Line Representations of Infinite Planar Graphs

✍ Scribed by Thomassen, C.

Book ID
120096509
Publisher
Oxford University Press
Year
1977
Tongue
English
Weight
362 KB
Volume
s2-16
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
✍ Lin Woo πŸ“‚ Article πŸ“… 1969 πŸ› Elsevier Science 🌐 English βš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

Rectangular and visibility representatio
Rectangular and visibility representations of infinite planar graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 75 KB

## Abstract We provide a new method for extending results on finite planar graphs to the infinite case. Thus a result of Ungar on finite graphs has the following extension: Every infinite, planar, cubic, cyclically 4‐edge‐connected graph has a representation in the plane such that every edge is a h