Geodesic
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
Discrete & computational geometry, Tome 12 (1994) no. 1, pp. 65-82.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : simple polygon, visibility graph, Hamiltonian cycle 
@article{DCG_1994__12_1_131318,
     author = {G. Srinivasaraghavan and A. Mukhopadhyay},
     title = {A {New} {Necessary} {Condition} for the {Vertex} {Visibility} {Graphs} of {Simple} {Polygons.}},
     journal = {Discrete & computational geometry},
     pages = {65--82},
     publisher = {mathdoc},
     volume = {12},
     number = {1},
     year = {1994},
     zbl = {0812.05062},
     url = {http://geodesic.mathdoc.fr/item/DCG_1994__12_1_131318/}
}
TY  - JOUR
AU  - G. Srinivasaraghavan
AU  - A. Mukhopadhyay
TI  - A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
JO  - Discrete & computational geometry
PY  - 1994
SP  - 65
EP  - 82
VL  - 12
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1994__12_1_131318/
ID  - DCG_1994__12_1_131318
ER  - 
%0 Journal Article
%A G. Srinivasaraghavan
%A A. Mukhopadhyay
%T A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
%J Discrete & computational geometry
%D 1994
%P 65-82
%V 12
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1994__12_1_131318/
%F DCG_1994__12_1_131318
G. Srinivasaraghavan; A. Mukhopadhyay. A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.. Discrete & computational geometry, Tome 12 (1994) no. 1, pp. 65-82. http://geodesic.mathdoc.fr/item/DCG_1994__12_1_131318/