✦ LIBER ✦

A new necessary condition for the vertex visibility graphs of simple polygons

✍ Scribed by G. Srinivasaraghavan; A. Mukhopadhyay

Book ID: 110561239
Publisher: Springer
Year: 1994
Tongue: English
Weight: 905 KB
Volume: 12
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574366

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A P-Completeness Result for Visibility G

A P-Completeness Result for Visibility Graphs of Simple Polygons

✍ Jana Dietel; Hans-Dietrich Hecker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

Efficiently Constructing the Visibility

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles

✍ Kapoor, Sanjiv; Maheshwari, S. N. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 256 KB

A Criterion for the t-Vertex Condition o

A Criterion for the t-Vertex Condition of Graphs

✍ Sven Reichard 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Combining two concepts of regularity of graphs, namely k-isoregularity and the t-vertex condition, a generalization of a classical result by Hestenes and Higman is presented. As an application it is shown that two infinite series of graphs constructed by Brouwer, Ivanov, and Klin which are not rank

A note on the combinatorial structure of

A note on the combinatorial structure of the visibility graph in simple polygons

✍ L. Prasad; S.S. Iyengar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 954 KB

Necessary and sufficient conditions for

Necessary and sufficient conditions for the geometric realizability of a simple incidence graph

✍ Robert Wells 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 822 KB

A necessary and sufficient condition for

A necessary and sufficient condition for the star decomposition of complete graphs

✍ Lin, Chiang; Shyu, Tay-Woei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

In this paper w e prove the following result. Let ml 2 m2 2 ... 2 ml be nonnegative integers. A necessary and sufficient condition for the complete graph K,, to be decomposed into stars S,,, , S