1-bend 3-D orthogonal box-drawings: Two open problems solved

DOI10.7155/JGAA.00034MaRDI QIDQ2724198zbMATH OpenOpenAlexFDO

Authors Therese Biedl

Publication date 10 July 2001

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/49074

zbMATH Keywords

box-drawingscube drawingRamanujan graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• The complexity of bendless three-dimensional orthogonal graph drawing
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• On bend-minimized orthogonal drawings of planar 3-graphs
• scientific article; zbMATH DE number 1953108
• scientific article; zbMATH DE number 2080105
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• A note on 3D orthogonal drawings with direction constrained edges
• scientific article; zbMATH DE number 1500687
• Three-Dimensional 1-Bend Graph Drawings
• Computing orthogonal drawings with the minimum number of bends

Cited in

(3)

• Linkless symmetric drawings of series parallel digraphs
• scientific article; zbMATH DE number 2080105 (Why is no real title available?)
• Bounds For Orthogonal 3-D Graph Drawing

This page was built for publication: 1-bend 3-D orthogonal box-drawings: Two open problems solved

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