Abstract
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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
APA
Nomura, K., Tayu, S., & Ueno, S. (2004). On the orthogonal drawing of outerplanar graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3106, 300–308. https://doi.org/10.1007/978-3-540-27798-9_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free