@article{Tóth_2024, title={On RAC Drawings of Graphs with Two Bends per Edge}, volume={28}, url={https://www.jgaa.info/index.php/jgaa/article/view/2939}, DOI={10.7155/jgaa.v28i2.2939}, abstractNote={<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>}, number={2}, journal={Journal of Graph Algorithms and Applications}, author={Tóth, Csaba}, year={2024}, month={Jun.}, pages={37–45} }