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

A graph is $(\mathcal{I}, \mathcal{F})$-colorable if its vertex set can bepartitioned into two subsets, one of which is an independent set, and the otherinduces a forest. In this paper, we prove that every planar graph without$5^{-}$-cycles at distance less than $3$ is $(\mathcal{I},\mathcal{F})$-colorable.

Planar graphs without $5^{-}$-cycles at distance less than $3$ are $(\mathcal{I}, \mathcal{F})$-colorable