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

A $\lambda K_v$ is a complete graph on $v$ vertices with $\lambda$ edgesbetween each pair of the $v$ vertices. A $(\lambda+\mu)K_{v+u}-\lambda K_v$ isa $(\lambda+\mu)K_{v+u}$ with the edge set of $\lambda K_v$ removed.Decomposing a $(\lambda+\mu)K_{v+u}-\lambda K_v$ into edge-disjoint $m$-cycleshas been studied by many people. To date, there is a complete solution for$m=4$ and partial results when $m=3$ or $m=5$. In this paper, we are able tosolve this problem for all even cycle lengths as long as $u,v\geq m+2$.

$m$-Cycle Packings of $(\lambda+\mu)K_{v+u}-\lambda K_v$: $m$ even