Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Cognitive measurements of graph aesthetics
Information Visualization
A characterization of complete bipartite RAC graphs
Information Processing Letters
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
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
On the size of graphs that admit polyline drawings with few bends and crossing angles
GD'10 Proceedings of the 18th international conference on Graph drawing
Maximizing the total resolution of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
The quality ratio of RAC drawings and planar drawings of planar graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
Graph Drawing Aesthetics—Created by Users, Not Algorithms
IEEE Transactions on Visualization and Computer Graphics
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
Theory of Computing Systems
1-planarity of complete multipartite graphs
Discrete Applied Mathematics
2-Layer right angle crossing drawings
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On the density of maximal 1-planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Testing maximal 1-planarity of graphs with a rotation system in linear time
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.04 |
A Right Angle Crossing Graph (also called a RAC graph for short) is a graph that has a straight-line drawing where any two crossing edges are orthogonal to each other. A 1-planar graph is a graph that has a drawing where every edge is crossed at most once. This paper studies the combinatorial relationship between the family of RAC graphs and the family of 1-planar graphs. It is proved that: (1) all RAC graphs having maximal edge density belong to the intersection of the two families; and (2) there is no inclusion relationship between the two families. As a by-product of the proof technique, it is also shown that every RAC graph with maximal edge density is the union of two maximal planar graphs.