English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing inthe plane, where the edges are polylines with two bends per edge and any pairof edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq3$. This improves upon the previous upper bound of $74.2n$; this is the firstimprovement in more than 12 years. A crucial ingredient of the proof is anupper bound on the size of plane multigraphs with polyline edges in which thefirst and last segments are either parallel or orthogonal.

On RAC Drawings of Graphs with Two Bends per Edge