A characterization of complete bipartite RAC graphs

Authors:
Walter Didimo;Peter Eades;Giuseppe Liotta
Affiliations:
University of Perugia, Italy;University of Sydney, Australia;University of Perugia, Italy
Venue:
Information Processing Letters
Year:
2010

Citing 2
Cited 6

Area, curve complexity, and crossing resolution of non-planar graph drawings

GD'09 Proceedings of the 17th international conference on Graph Drawing
On the perspectives opened by right angle crossing drawings

GD'09 Proceedings of the 17th international conference on Graph Drawing

The straight-line RAC drawing problem is NP-hard

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Bounds on the crossing resolution of complete geometric graphs

Discrete Applied Mathematics
2-Layer right angle crossing drawings

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Right angle crossing graphs and 1-planarity

GD'11 Proceedings of the 19th international conference on Graph Drawing
Vertex angle and crossing angle resolution of leveled tree drawings

Information Processing Letters
Right angle crossing graphs and 1-planarity

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.