arallel Graphs (Extended Abstract) Satoshi Tayu, Kumiko Nomura, and Shuichi Ueno Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan — It has been known that every 6-graph has a 3-bend 3-D orthogonal drawing, while it has been open whether every 6graph has a 2-bend 3-D orthogonal drawing. For the interesting open question, it is known that every 5-graph has a 2-bend 3D orthogonal drawing, and every outerplanar 6-graph without triangles has a 0-bend 3-D orthogonal drawing. We show in this paper that every series-parallel 6-graph has a 2-bend 3-D orthogonal drawing.