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

Packing colouring of a graph G is a partitioning of the vertex set of G with the property that vertices in i-th class have pairwise distance greater than i. The packing chromatic number of G is the smallest integer k such that the vertex set of G can be partitioned as X1,X2, . . . ,Xk where Xi is an i-packing for each i. In the paper, the packing chromatic numbers for all Platonic solids as well as for all prisms are given.

On the packing chromatic number of semiregular polyhedra