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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

For a set of nonnegative integers (c_1, ldots , c_k), a ((c_1, c_2,ldots , c_k))-coloring of a graph G is a partition of V(G) into (V_1, ldots , V_k) such that for every i, (1le ile k, G[V_i]) has maximum degree at most (c_i). We prove that all planar graphs without 4-cycles and no less than two edges between triangles are (2, 0, 0)-colorable.

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable