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

A proper vertex coloring of a graph $G$ is equitable if the sizes of colorclasses differ by at most one. The equitable chromatic threshold$\chi_{eq}^*(G)$ of $G$ is the smallest integer $m$ such that $G$ is equitably$n$-colorable for all $n\ge m$. We show that for planar graphs $G$ with minimumdegree at least two, $\chi_{eq}^*(G)\le 4$ if the girth of $G$ is at least$10$, and $\chi_{eq}^*(G)\le 3$ if the girth of $G$ is at least $14$.

Equitable coloring of sparse planar graphs