For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On the Orthogonal Drawing of Outerplanar Graphs
Kumiko NOMURA Satoshi TAYU Shuichi UENO
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/06/01
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs and Networks
orthogonal drawing, bend, outerplanar graph,
Full Text: PDF(213.1KB)>>
In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.