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

Let $G$ be a graph and $C$ a finite set of colours. A vertex colouring$f:V(G)\to C$ is complete if for any pair of distinct colours $c_1,c_2\in C$one can find an edge $\{v_1,v_2\}\in E(G)$ such that $f(v_i)=c_i$, $i=1,2$. Theachromatic number of $G$ is defined to be the maximum number $\mathrm{achr}(G)$of colours in a proper complete vertex colouring of $G$. In the paper$\mathrm{achr}(K_6\square K_q)$ is determined for any integer $q$ such thateither $8\le q\le40$ or $q\ge42$ is even.

The achromatic number of the Cartesian product of $K_6$ and $K_q$