Disproving a conjecture on planar visibility graphs

DOI10.1016/S0304-3975(00)00391-1zbMath0974.68144OpenAlexW2025031016WikidataQ122908112 ScholiaQ122908112MaRDI QIDQ5941094

No author found.

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00391-1

zbMATH Keywords

Hamiltonian cycleplanar graphcomputational geometryvisibility graphvisibility problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recognizing and characterizing visibility graphs of simple polygons
• Characterizing and recognizing weak visibility polygons
• A note on visibility graphs
• Computing the full visibility graph of a set of line segments
• Some results on visibility graphs
• A new necessary condition for the vertex visibility graphs of simple polygons
• Two segment classes with Hamiltonian visibility graphs
• A note on minimal visibility graphs
• DISTANCE VISIBILITY GRAPHS
• Recognizing visibility graphs of spiral polygons
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• COMPUTATIONAL GEOMETRY COLUMN 18
• Computing the visibility polygon from a convex set and related problems

This page was built for publication: Disproving a conjecture on planar visibility graphs