A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum volume of such a drawing is Θ(cn), where n is the number of vertices and c is the cutwidth of the graph. We then prove that every graph has a three-dimensional grid-drawing with O(n 3 / log 2 n) volume and one bend per edge. The best previous bound was O(n 3 ).doi:10.7155/jgaa.00095 fatcat:urop3lfl2ne2vcgnn5wonghvp4