We consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden subconfigurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characteriza
✦ LIBER ✦
Sand drawings and Gaussian graphs§
✍ Scribed by Demaine, E. D.; Demaine, M. L.; Taslakian, P.; Toussaint, G. T.
- Book ID
- 127256487
- Publisher
- Taylor and Francis Group
- Year
- 2007
- Tongue
- English
- Weight
- 230 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1751-3472
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Rectilinear drawings of graphs
✍
Carsten Thomassen
📂
Article
📅
1988
🏛
John Wiley and Sons
🌐
English
⚖ 314 KB
Bipartite graphs, upward drawings, and p
✍
Giuseppe Di Battista; Wei-Ping Liu; Ivan Rival
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 451 KB
Monotone drawings of planar graphs
✍
János Pach; Géza Tóth
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 92 KB
## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross
Small Drawings of Outerplanar Graphs, Se
✍
Therese Biedl
📂
Article
📅
2010
🏛
Springer
🌐
English
⚖ 618 KB
Convex drawings of hierarchical planar g
✍
Seok-Hee Hong; Hiroshi Nagamochi
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 469 KB
[Lecture Notes in Computer Science] Grap
✍
North, Stephen
📂
Article
📅
1997
🏛
Springer Berlin Heidelberg
⚖ 843 KB