A characterization of complete bipartite RAC graphs

A Right Angle Crossing drawing (RAC drawing for short) of a graph is such that edges can only cross at an angle of @p2. In this paper we provide a characterization of the complete bipartite graphs that admit a straight-line RAC drawing.

[1]  Michael Kaufmann,et al.  On the Perspectives Opened by Right Angle Crossing Drawings , 2009, J. Graph Algorithms Appl..

[2]  Peter Eades,et al.  Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.

[3]  Joachim Gudmundsson,et al.  Notes on Large Angle Crossing Graphs , 2009, Chic. J. Theor. Comput. Sci..

[4]  Michael Kaufmann,et al.  Journal of Graph Algorithms and Applications on the Perspectives Opened by Right Angle Crossing Drawings , 2022 .

[5]  Walter Didimo,et al.  Drawing Graphs with Right Angle Crossings , 2009, WADS.

[6]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2009, Theory of Computing Systems.

[7]  Weidong Huang,et al.  Using eye tracking to investigate graph layout effects , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.

[8]  Daniel J. Kleitman,et al.  The crossing number of K5,n , 1970 .