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

For a simple polygon \(P\), let \(V\) be the set of vertices of \(P\) and \(E\) the set of pairs \((u,v)\) of vertices for which the segment \(\overline{uv}\) does not intersect the exterior of \(P\). The graph \(G= (V,E)\) is called the visibility graph of \(P\). Everett (Thesis 1989) conjectured that for a given graph \(G\) with a Hamiltonian cycle \(H\) to be the visibility graph of a polygon (and such that \(H\) corresponds to the boundary of \(P\)), the following condition is necessary: For every pair of vertices \((u,v)\) with \(\overline{uv}\not\in E\) there exists a blocking vertex \(w= B(u,v)\) in between, and such that \(B(u,v)= B(u',v')\) implies that \((u,v)\) and \((u',v')\) are not separable with respect to \(w\) on \(H\). The authors settle this conjecture in the affirmative by a sequence of lemmas.