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

Given two graphs G and H , a ( G , H )-multidecomposition of K n is a partition of the edges of K n into copies of G and H such that at least one copy of each is used. We give necessary and sufficient conditions for the existence of (C 6 ,Ċ 6 )-multidecomposition of K n where C 6 denotes a cycle of length 6 and C 6 denotes the complement of C 6 . We also characterize the cardinalities of leaves and paddings of maximum (C 6 ,Ċ 6 )-multipackings and minimum (C 6 ,Ċ 6 )-multicoverings, respectively.

Multidesigns for the graph pair formed by the 6-cycle and 3-prism