Graphs that admit right angle crossing drawings

Authors:
Karin Arikushi;Radoslav Fulek;Balázs Keszegh;Filip Morić;Csaba D. Tóth
Affiliations:
University of Calgary, Canada;Ecole Polytechnique Fédérale de Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Switzerland and Alfréd Rényi Institute of Mathematics, Budapest, Hungary;Ecole Polytechnique Fédérale de Lausanne, Switzerland;University of Calgary, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2012

Citing 6
Cited 0

Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks

Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

Discrete & Computational Geometry
Note: On the maximum number of edges in quasi-planar graphs

Journal of Combinatorial Theory Series A
Notes on large angle crossing graphs

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
On the size of graphs that admit polyline drawings with few bends and crossing angles

GD'10 Proceedings of the 18th international conference on Graph drawing
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.