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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We determine the list chromatic number of the square of a graph $\chil(G^2)$in terms of its maximum degree $\Delta$ when its maximum average degree,denoted $\mad(G)$, is sufficiently small. For $\Delta\ge 6$, if$\mad(G)<2+\frac{4\Delta-8}{5\Delta+2}$, then $\chil(G^2)=\Delta+1$. Inparticular, if $G$ is planar with girth $g\ge 7+\frac{12}{\Delta-2}$, then$\chil(G^2)=\Delta+1$. Under the same conditions, $\chil^i(G)=\Delta$, where$\chil^i$ is the list injective chromatic number.

Sufficient sparseness conditions for G^2 to be (\Delta+1)-choosable, when \Delta\ge5