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/

Zendy Plus

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

Zendy Tools

Zendy Open

A graph is (7, 2)-edge-choosable if, for every assignment of lists of size 7to the edges, it is possible to choose two colors for each edge from its listso that no color is chosen for two incident edges. We show that every3-edge-colorable graph is (7, 2)-edge-choosable and also that manynon-3-edge-colorable 3-regular graphs are (7, 2)-edge-choosable.

Classes of 3-regular graphs that are (7, 2)-edge-choosable