A note on minimal visibility graphs

DOI10.1016/0020-0190(93)90205-NzbMATH Open0770.68118OpenAlexW2064013963MaRDI QIDQ1802067FDOQ1802067

Authors: Qing Hu, Xiaojun Shen 

Publication date: 8 August 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90205-n

Recommendations

• Negative results on characterizing visibility graphs
• Minimal visibility graphs
• Correction to: ``Outer 1-planar graphs
• A note on the paper ``On Brlek-Reutenauer conjecture
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A tight lower bound on the size of visibility graphs
• Minimal visibility graphs

Cited In (4)

• A necessary condition for a graph to be the visibility graph of a simple polygon
• A note on visibility graphs
• Minimal tangent visibility graphs
• Disproving a conjecture on planar visibility graphs

This page was built for publication: A note on minimal visibility graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802067)