Loading...
conference paper
Graphs that Admit Right Angle Crossing Drawings
2010
Graph Theoretic Concepts in Computer Science - 36th International Workshop
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al.
Type
conference paper
Web of Science ID
WOS:000289453400014
Authors
Publication date
2010
Published in
Graph Theoretic Concepts in Computer Science - 36th International Workshop
Volume
36
Start page
135
End page
146
Peer reviewed
NON-REVIEWED
EPFL units
Event name |
Available on Infoscience
December 30, 2010
Use this identifier to reference this record