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

The cluster of a crossing in a graph drawing in the plane is the set of thefour end-vertices of its two crossed edges. Two crossings are independent iftheir clusters do not intersect. In this paper, we prove that every plane graphwith independent crossings has an equitable partition into $m$ induced forestsfor any $m\geq 8$. Moreover, we decrease this lower bound 8 for $m$ to 6, 5, 4and 3 if we additionally assume that the girth of the considering graph is atleast 4, 5, 6 and 26, respectively.

Equitable partition of plane graphs with independent crossings into induced forests