Journal ArticleOPEN ACCESS

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

Discrete & Computational Geometry (1994) 12(1) 65-82
DOI: 10.1007/BF02574366
9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new necessary condition conjectured by Everett [2], which is essentially a stronger version of a necessary condition by Ghosh [3], for a graph to be the vertex visibility graph of a simple polygon is established. © 1994 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Srinivasaraghavan, G., & Mukhopadhyay, A. (1994). A new necessary condition for the vertex visibility graphs of simple polygons. Discrete & Computational Geometry, 12(1), 65–82. https://doi.org/10.1007/BF02574366

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free