A new necessary condition for the vertex visibility graphs of simple polygons
From MaRDI portal
Publication:1330885
DOI10.1007/BF02574366zbMath0812.05062MaRDI QIDQ1330885
G. Srinivasaraghavan, Asish Kumar Mukhopadhyay
Publication date: 10 August 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131318
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Convex sets in (2) dimensions (including convex curves) (52A10) Graph theory (05C99) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Eulerian and Hamiltonian graphs (05C45)
Related Items
A Characterization of Visibility Graphs for Pseudo-polygons ⋮ On recognizing and characterizing visibility graphs of simple polygons ⋮ Disproving a conjecture on planar visibility graphs ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon
Cites Work
