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/

Zendy Plus

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

Zendy Tools

Zendy Open

The concept of DP-coloring of a graph is a generalization of list coloringintroduced by Dvo\v{r}\'{a}k and Postle in 2015. Multiple DP-coloring ofgraphs, as a generalization of multiple list coloring, was first studied byBernshteyn, Kostochka and Zhu in 2019. This paper proves that planar graphswithout 3-cycles and normally adjacent 4-cycles are $(7m, 2m)$-DP-colorable forevery integer $m$. As a consequence, the strong fractional choice number of anyplanar graph without 3-cycles and normally adjacent 4-cycles is at most $7/2$.

Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles