1. J. Bensmail, A. Harutyunyan, T.-N. Le, M. Merker and S. Thomassé: A Proof of the Barát-Thomassen Conjecture. Journal of Combinatorial Theory, Series B
124 (2017), 39–55.
2. F. Botler, G. O. Mota, M. Oshiro and Y. Wakabayashi: Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B
122 (2017), 508–542.
3. F. Botler, G. O. Mota, M. Oshiro and Y. Wakabayashi: Decompositions of highly connected graphs into paths of length five. Discrete Applied Mathematics, Doi: 10.1016/j.dam.2016.08.001, 2016.
4. J. Barát and C. Thomassen: Claw-decompositions and Tutte-orientations. Journal of Graph Theory
52 (2006), 135–146.
5. J. Edmonds: Edge-disjoint branchings, Combinatorial Algorithms (B. Rustin, editor), 91–96, Academic Press, 1973.