Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
From MaRDI portal
Publication:4435327
DOI10.7155/jgaa.00060zbMath1027.05094OpenAlexW2112474334MaRDI QIDQ4435327
Publication date: 30 November 2003
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/50438
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings