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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We solve a problem of Dujmovi\'c and Wood (2007) by showing that a completeconvex geometric graph on $n$ vertices cannot be decomposed into fewer than$n-1$ star-forests, each consisting of noncrossing edges. This bound is clearlytight. We also discuss similar questions for abstract graphs.

Decomposition of Geometric Graphs into Star Forests