𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Further Results on Bar k-Visibility Graphs

✍ Scribed by Hartke, Stephen G.; Vandenbussche, Jennifer; Wenger, Paul


Book ID
118196916
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
154 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Some results on visibility graphs
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 897 KB
Negative results on characterizing visib
✍ H. Everett; D. Corneil πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 860 KB

There is no known combinatorial characterization of the visibility graphs of simple polygons. In this paper we show negative results on two different approaches to finding such a characterization. We show that Ghosh's three necessary conditions for a graph to be a visibility graph are not sufficient