𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constrained visibility representations of graphs

✍ Scribed by Giuseppe Di Battista; Roberto Tamassia; Ioannis G. Tollis

Book ID
107766026
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
521 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Visibility graphs of towers
Visibility graphs of towers
✍ Paul Colley; Anna Lubiw; Jeremy Spinrad πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 813 KB

A tower is a polygon consisting of two reflex chains sharing one common endpoint, together with one edge joining the other endpoints of the chains. A linear time algorithm is given to recognize the [vertex] visibility graphs of towers, and these graphs are characterized as bipartite permutation grap