On an extremal problem for colored trees
European Journal of Combinatorics
Drawing graphs: methods and models
Drawing graphs: methods and models
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Graph Drawing Software
Cognitive measurements of graph aesthetics
Information Visualization
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings
Discrete & Computational Geometry
Note: On the maximum number of edges in quasi-planar graphs
Journal of Combinatorial Theory Series A
On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges
Discrete & Computational Geometry
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
Exploring the relative importance of crossing number and crossing angle
Proceedings of the 3rd International Symposium on Visual Information Communication
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
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
Graphs that admit right angle crossing drawings
Computational Geometry: Theory and Applications
2-Layer right angle crossing drawings
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Heuristics for the maximum 2-layer RAC subgraph problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Establishing aesthetics based on human graph reading behavior: two eye tracking studies
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
A graph G is an a 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