Minimal visibility graphs
β Scribed by Douglas Campbell; John Higgins
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 583 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a set S = {s 1, s 2, ..., s,,) of vertical line segments, si, sj see each other ff there is a horizontal line segment which intersects them, but does not intersect any other line segment between them. A ws" ibility graph G of vertices {vl, v2, β’ .., v,,} is put into a one-to-one correspondenc
Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs, Discrete Mathematics 92 (1991) 95-105. The closed neighbourhood of a vertex u of a graph G is u\* = {v 1 v is adjacent to u} U {u}. G is neighbourhood-connected if it is connected, and G -u' is connected but not complete, for al
## 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