✦ LIBER ✦

Some results on visibility graphs

✍ Scribed by Thomas Andreae

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 897 KB
Volume: 40
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90018-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Negative results on characterizing visib

Negative results on characterizing visibility graphs

✍ 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

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

Some recent results on niche graphs

✍ Stephen Bowser; Charles A. Cable 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Some results on graph parameters in weig

Some results on graph parameters in weighted graphs

✍ Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 295 KB

A note on minimal visibility graphs

✍ Xiaojun Shen; Qing Hu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 60 KB

Some results on odd factors of graphs

✍ Cui Yuting; Mikio Kano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views