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

A $2$-distance $k$-coloring of a graph is a proper vertex $k$-coloring wherevertices at distance at most 2 cannot share the same color. We prove theexistence of a $2$-distance $4$-coloring for planar subcubic graphs with girthat least 21. We also show a construction of a planar subcubic graph of girth 11that is not $2$-distance $4$-colorable.

2-distance 4-coloring of planar subcubic graphs with girth at least 21