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

Xu and Wu proved that if every $5$-cycle of a planar graph $G$ is notsimultaneously adjacent to $3$-cycles and $4$-cycles, then $G$ is$4$-choosable. In this paper, we improve this result as follows. Let $\{i, j,k, l\} = \{3,4,5,6\}.$ For any chosen $i,$ if every $i$-cycle of a planar graph$G$ is not simultaneously adjacent to $j$-cycles, $k$-cycles, and $l$-cycles,then $G$ is $4$-choosable.

Sufficient conditions on cycles that make planar graphs 4-choosable