Abstract. A graph G is an α angle crossing (αAC) graph if every pair of crossing edges in G intersect at an angle of at least α. The concept of right angle crossing (RAC) graphs (α = π/2) was recently introduced by Didimo et al. [7] . It was shown that any RAC graph with n vertices has at most 4n − 10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n − 10 edges. In this paper, we give upper and lower bounds for the number of edges in αAC graphs for all 0 < α < π/2. ½ ÁÒØÖÓ ÙØ ÓÒ
Dujmovic et al. REF proved that an n-vertex graph with crossing resolution at least α radians, has at most (3n − 6)π/α edges.
Notes on large angle crossing graphs
Chicago Journal of Theoretical Computer Science, Article 2011-4
Mathematics Computer Science