A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.

G. Srinivasaraghavan; A. Mukhopadhyay

Discrete & computational geometry (1994)

  • Volume: 12, Issue: 1, page 65-82
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Srinivasaraghavan, G., and Mukhopadhyay, A.. "A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.." Discrete & computational geometry 12.1 (1994): 65-82. <http://eudml.org/doc/131318>.

@article{Srinivasaraghavan1994,
author = {Srinivasaraghavan, G., Mukhopadhyay, A.},
journal = {Discrete & computational geometry},
keywords = {simple polygon; visibility graph; Hamiltonian cycle},
number = {1},
pages = {65-82},
title = {A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.},
url = {http://eudml.org/doc/131318},
volume = {12},
year = {1994},
}

TY - JOUR
AU - Srinivasaraghavan, G.
AU - Mukhopadhyay, A.
TI - A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
JO - Discrete & computational geometry
PY - 1994
VL - 12
IS - 1
SP - 65
EP - 82
KW - simple polygon; visibility graph; Hamiltonian cycle
UR - http://eudml.org/doc/131318
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.