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 zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

A uniquely $k$-colourable graph is a graph with exactly one partition of thevertex set into at most $k$ colour classes. Here, we investigate someconstructions of uniquely $k$-colourable graphs and give a construction of$K_k$-free uniquely $k$-colourable graphs with equal colour class sizes.

A Construction of Uniquely Colourable Graphs with Equal Colour Class Sizes