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

DP-coloring as a generalization of list coloring was introduced byDvo\v{r}\'{a}k and Postle in 2017, who proved that every planar graph withoutcycles from 4 to 8 is 3-choosable, which was conjectured by Borodin {\it etal.} in 2007. In this paper, we prove that every planar graph without adjacentcycles of length at most $8$ is $3$-choosable, which extends this result ofDvo\v{r}\'{a}k and Postle.

Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable