Decompositions of highly connected graphs into paths of length five

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$ such that, 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 Decomposition Conjecture for paths of length $5$.

[1]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[2]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[3]  Carsten Thomassen,et al.  Decomposing graphs into paths of fixed length , 2013, Comb..

[4]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[5]  Nathaniel Dean,et al.  Gallai's conjecture for disconnected graphs , 2000, Discret. Math..

[6]  Carsten Thomassen.  Decompositions of highly connected graphs into paths of length 3 , 2008 .

[7]  Carsten Thomassen,et al.  Decomposing a graph into bistars , 2013, J. Comb. Theory, Ser. B.

[8]  Alan Donald,et al.  An upper bound for the path number of a graph , 1980, J. Graph Theory.

[9]  John Adrian Bondy.  Perfect path double covers of graphs , 1990, J. Graph Theory.

[10]  Jin Akiyama,et al.  Factors and Factorizations of Graphs , 2011 .

[11]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[12]  Katherine Heinrich,et al.  P 4 -decompositions of regular graphs , 1999 .

[13]  Genghua Fan.  Path decompositions and Gallai's conjecture , 2005, J. Comb. Theory, Ser. B.

[14]  László Pyber,et al.  Covering the Edges of a Connected Graph by Paths , 1996, J. Comb. Theory, Ser. B.

[15]  Yoshiko Wakabayashi,et al.  Decompositions of triangle-free 5-regular graphs into paths of length five , 2015, Discret. Math..

[16]  C. Thomassen,et al.  Claw-decompositions and tutte-orientations , 2006 .

[17]  C. Nash-Williams,et al.  Connected detachments of graphs and generalized Euler trails , 1985 .

[18]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[19]  Regina Tyshkevich,et al.  Decomposition of graphs , 1985 .

[20]  Dániel Gerbner,et al.  Edge-decomposition of Graphs into Copies of a Tree with Four Edges , 2012, Electron. J. Comb..

[21]  Odile Favaron,et al.  Regular path decompositions of odd regular graphs , 2010 .

[22]  Carsten Thomassen,et al.  The weak 3-flow conjecture and the weak circular flow conjecture , 2012, J. Comb. Theory, Ser. B.

[23]  Carsten Thomassen,et al.  Edge-decompositions of highly connected graphs into paths , 2008 .