Directed rectangle-visibility graphs have unbounded dimension

DOI10.1016/S0166-218X(96)00075-3zbMath0865.68096OpenAlexW2037649643MaRDI QIDQ674919

Kathleen Romanik

Publication date: 6 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

visibility representationsrectangle-visibility graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• A unified approach to visibility representations of planar graphs
• Representing orders on the plane by translating convex figures
• Algorithms for plane representations of acyclic digraphs
• Algorithms for drawing graphs: An annotated bibliography
• POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION

This page was built for publication: Directed rectangle-visibility graphs have unbounded dimension