A characterization of complete bipartite RAC graphs

作者：Didimo Walter^*; Eades Peter; Liotta Giuseppe

来源：Information Processing Letters, 2010, 110(16): 687-691.

DOI：10.1016/j.ipl.2010.05.023

• Computational geometry
• Combinatorial problems
• Graph algorithms
• Theory of computation

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

• 出版日期2010-7-31