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

Two cycles are {\em adjacent} if they have an edge in common. Suppose that$G$ is a planar graph, for any two adjacent cycles $C_{1}$ and $C_{2}$, we have$|C_{1}| + |C_{2}| \geq 11$, in particular, when $|C_{1}| = 5$, $|C_{2}| \geq7$. We show that the graph $G$ is 3-colorable.

Every planar graph without adjacent short cycles is 3-colorable