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 is a generalization of a list coloring in simple graphs. Manyresults in list coloring can be generalized in those of DP-coloring. Kim andOzeki showed that planar graphs without $k$-cycles where $k=3,4,5,$ or $6$ areDP-$4$-colorable. Recently, Kim and Yu extended the result on $3$- and$4$-cycles by showing that planar graphs without triangles adjacent to$4$-cycles are DP-$4$-colorable. Xu and Wu showed that planar graphs without$5$-cycles adjacent simultaneously to $3$-cycles and $4$-cycles are$4$-choosable. In this paper, we extend the result on $5$-cycles and trianglesadjacent to $4$-cycles by showing that planar graphs without $i$-cyclesadjacent simultaneously to $j$-cycles and $k$-cycles are DP-$4$-colorable when$\{i,j,k\}=\{3,4,5\}.$ This also generalizes the result of Xu and Wu.

Every planar graph without $i$-cycles adjacent simultaneously to $j$-cycles and $k$-cycles is DP-$4$-colorable when $\{i,j,k\}=\{3,4,5\}$