𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A note on minimal visibility graphs
✍ Xiaojun Shen; Qing Hu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 60 KB
A note on visibility graphs
✍ F Luccio; S Mazzone; C.K Wong πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 602 KB

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

Minimal k-arc connected graphs
✍ D. R. Fulkerson; L. S. Shapley πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 364 KB
On minimal neighbourhood-connected graph
✍ Bert L. Hartnell; William Kocay πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 809 KB

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

On minimal elementary bipartite graphs
✍ L LovΓ‘sz; M.D Plummer πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 587 KB
Rectangular and visibility representatio
✍ 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