Graphs that admit right angle crossing drawings (Q419368): Difference between revisions

The authors 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. It is shown 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.