DeepAI AI Chat
Log In Sign Up

On RAC Drawings of Graphs with one Bend per Edge

by   Patrizio Angelini, et al.

A k-bend right-angle-crossing drawing or (k-bend RAC drawing, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing points of the edges are 90 degrees. Accordingly, a graph that admits a k-bend RAC drawing is referred to as k-bend right-angle-crossing graph (or k-bend RAC, for short). In this paper, we continue the study of the maximum edge-density of 1-bend RAC graphs. We show that an n-vertex 1-bend RAC graph cannot have more than 5.5n-O(1) edges. We also demonstrate that there exist infinitely many n-vertex 1-bend RAC graphs with exactly 5n-O(1) edges. Our results improve both the previously known best upper bound of 6.5n-O(1) edges and the corresponding lower bound of 4.5n-O(√(n)) edges by Arikushi et al. (Comput. Geom. 45(4), 169--177 (2012)).


Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-pla...

On RAC Drawings of Graphs with Two Bends per Edge

It is shown that every n-vertex graph that admits a 2-bend RAC drawing i...

RAC Drawings in Subcubic Area

In this paper, we study tradeoffs between curve complexity and area of R...

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

In a right-angle crossing (RAC) drawing of a graph, each edge is represe...

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs

In the area of graph drawing, the One-Sided Crossing Minimization Proble...

Axis-Parallel Right Angle Crossing Graphs

A RAC graph is one admitting a RAC drawing, that is, a polyline drawing ...

On the number of edges of separated multigraphs

We prove that the number of edges of a multigraph G with n vertices is a...