IEICE TRANSACTIONS on Fundamentals
On the Orthogonal Drawing of Outerplanar Graphs
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.6 pp.1583-1588
- Publication Date
- 2005/06/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.6.1583
- Type of Manuscript
- PAPER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kumiko NOMURA, Satoshi TAYU, Shuichi UENO, "On the Orthogonal Drawing of Outerplanar Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 6, pp. 1583-1588, June 2005, doi: 10.1093/ietfec/e88-a.6.1583.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.6.1583/_p
Copy
@ARTICLE{e88-a_6_1583,
author={Kumiko NOMURA, Satoshi TAYU, Shuichi UENO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Orthogonal Drawing of Outerplanar Graphs},
year={2005},
volume={E88-A},
number={6},
pages={1583-1588},
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.},
keywords={},
doi={10.1093/ietfec/e88-a.6.1583},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - On the Orthogonal Drawing of Outerplanar Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1583
EP - 1588
AU - Kumiko NOMURA
AU - Satoshi TAYU
AU - Shuichi UENO
PY - 2005
DO - 10.1093/ietfec/e88-a.6.1583
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2005
AB - 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.
ER -
English
