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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We consider straight-line outerplanar drawings of outerplanar graphs in whicha small number of distinct edge slopes are used, that is, the segmentsrepresenting edges are parallel to a small number of directions. We prove that$\Delta-1$ edge slopes suffice for every outerplanar graph with maximum degree$\Delta\ge 4$. This improves on the previous bound of $O(\Delta^5)$, which wasshown for planar partial 3-trees, a superclass of outerplanar graphs. The boundis tight: for every $\Delta\ge 4$ there is an outerplanar graph with maximumdegree $\Delta$ that requires at least $\Delta-1$ distinct edge slopes in anouterplanar straight-line drawing.

Outerplanar graph drawings with few slopes