Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

DOI10.7155/JGAA.00060MaRDI QIDQ4435327zbMATH OpenOpenAlexFDO

Authors David R. Wood

Publication date 30 November 2003

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 2080105
• Bounds For Orthogonal 3-D Graph Drawing
• Lower bounds for planar orthogonal drawings of graphs
• scientific article; zbMATH DE number 1953108
• New Lower Bounds For Orthogonal Drawings

Cited in

(8)

• Lower bounds for planar orthogonal drawings of graphs
• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• On the Total Number of Bends for Planar Octilinear Drawings
• scientific article; zbMATH DE number 2080105 (Why is no real title available?)
• scientific article; zbMATH DE number 1500675 (Why is no real title available?)
• Drawing Kn in Three Dimensions with One Bend per Edge
• Graph Drawing
• Complexity results for three-dimensional orthogonal graph drawing

This page was built for publication: Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

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