Embeddings of star graphs into optical meshes without bends
Journal of Parallel and Distributed Computing
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
Discrete Applied Mathematics
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
On the Orthogonal Drawing of Outerplanar Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Universality considerations in VLSI circuits
IEEE Transactions on Computers
No-bend orthogonal drawings of series-parallel graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Orthogonal drawings of series-parallel graphs with minimum bends
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Hi-index | 0.04 |
It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing, with the only exception being the octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception being K"4, and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing.