Disproving a conjecture on planar visibility graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 434872
- scientific article; zbMATH DE number 4085050
- A new necessary condition for the vertex visibility graphs of simple polygons
- A necessary condition for a graph to be the visibility graph of a simple polygon
- Negative results on characterizing visibility graphs
Cites work
- scientific article; zbMATH DE number 434872 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A new necessary condition for the vertex visibility graphs of simple polygons
- A note on minimal visibility graphs
- A note on visibility graphs
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- COMPUTATIONAL GEOMETRY COLUMN 18
- Characterizing and recognizing weak visibility polygons
- Computing the full visibility graph of a set of line segments
- Computing the visibility polygon from a convex set and related problems
- DISTANCE VISIBILITY GRAPHS
- Graph theory
- On recognizing and characterizing visibility graphs of simple polygons
- Recognizing visibility graphs of spiral polygons
- Some results on visibility graphs
- Two segment classes with Hamiltonian visibility graphs
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
Cited in
(3)
This page was built for publication: Disproving a conjecture on planar visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941094)