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

We classify two problems: Exact-Four-Colorability and the winner problem for Young elections. Regarding the former problem, Wagner raised the question of whether it is DP-complete to determine if the chromatic number of a given graph is exactly four. We prove a general result that in particular solves Wagner’s question in the affirmative.

Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections