A new necessary condition for the vertex visibility graphs of simple polygons |
| |
| Authors: | G. Srinivasaraghavan A. Mukhopadhyay |
| |
| Affiliation: | (1) The Institute of Mathematical Sciences, C.I.T. Campus, 600 113 Madras, India;(2) Department of Computer Science and Engineering, Indian Institute of Technology, 208 016 Kanpur, India |
| |
| 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. This work was carried out while G. Srinivasaraghavan was at the Indian Institute of Technology, Kanpur, India. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
