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

Assume G is a graph and k is a positive integer. Let f: V(G) to N be definedas f(v)=min{k, d_G(v)}. If G is DP-f-colourable (respectively, f-choosable),then we say G is DP-k-truncated-degree-colourable (respectively,k-truncated-degree-choosable). Hutchinson [On list-colouring outerplanargraphs. J. Graph Theory] proved that 2-connected maximal outerplanar graphsother than the triangle are 5-truncated-degree-choosable. This result wasrecently improved by Dai, Hu, Li, and Maezawa in [On DP-colouring ofouterplanar graphs. Manuscript, 2023], where it is proved that 2-connectedouterplanar graphs other than cycles are DP-5-truncated-degree-colourable. Thispaper further improves this result and proves that 2-connected K_{2,4}-minorfree graphs other than cycles and complete graphs areDP-$5$-truncated-degree-colourable.

DP-$5$-truncated-degree-colourability of $K_{2,4}$-minor free graphs