Negative results on characterizing visibility graphs

AbstractThere is no known combinatorial characterization of the visibility graphs of simple polygons. In this paper we show negative results on two different approaches to finding such a characterization. We show that Ghosh's three necessary conditions for a graph to be a visibility graph are not sufficient thus disproving his conjecture. We also show that there is no finite set of minimal forbidden induced subgraphs that characterize visibility graphs