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

Neumann-Lara (1985) and \v{S}krekovski conjectured that every planar digraphwith digirth at least three is 2-colorable. We prove a relaxed version of thisconjecture: every planar digraph of digirth at least five is 2-colorable. Theresult also holds in the setting of list colorings.

Planar digraphs of digirth five are 2-colorable