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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study the Decomposition Conjecture posed by Bar\'at and Thomassen (2006),which states that for every tree $T$ there exists a natural number $k_T$ suchthat, if $G$ is a $k_T$-edge-connected graph and $|E(T)|$ divides $|E(G)|$,then $G$ admits a decomposition into copies of $T$. In a series of papers,Thomassen verified this conjecture for stars, some bistars, paths of length$3$, and paths whose length is a power of $2$. We verify the DecompositionConjecture for paths of length $5$.

Decompositions of highly connected graphs into paths of length five