TY - JOUR
AU - Tóth, Csaba
PY - 2024/06/10
Y2 - 2024/10/08
TI - On RAC Drawings of Graphs with Two Bends per Edge
JF - Journal of Graph Algorithms and Applications
JA - JGAA
VL - 28
IS - 2
SE -
DO - 10.7155/jgaa.v28i2.2939
UR - https://www.jgaa.info/index.php/jgaa/article/view/2939
SP - 37-45
AB - <pre>It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$. <br>This improves upon the previous upper bound of $74.2n$; this is the first improvement in more than 12 years. A crucial ingredient of the proof is an upper bound on the size of plane multigraphs with polyline edges in which the first and last segments are either parallel or orthogonal.</pre>
ER -