Drawing Kn in Three Dimensions with One Bend per Edge

DOI10.7155/JGAA.00128MaRDI QIDQ5301393zbMATH OpenOpenAlexFDO

Authors Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, S. Wismath

Publication date 19 January 2009

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/55402, http://www.emis.de/journals/JGAA/accepted/2006/Devillers+2006.10.2.pdf

Mathematics Subject Classification ID

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

Recommendations

• Graph Drawing
• Three-Dimensional 1-Bend Graph Drawings
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• scientific article; zbMATH DE number 2080105
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• Drawing outerplanar graphs using three edge lengths
• On RAC drawings of graphs with one bend per edge
• On RAC drawings of graphs with one bend per edge
• One-bend drawings of outerplanar graphs inside simple polygons
• The complexity of bendless three-dimensional orthogonal graph drawing

Cited in

(2)

• scientific article; zbMATH DE number 790423 (Why is no real title available?)
• Graph Drawing

This page was built for publication: Drawing Kn in Three Dimensions with One Bend per Edge

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