1. The complexity of finding arc-disjoint branching flows;Bang-Jensen;Discrete Appl. Math.,2016
2. S. Bessy, F. Hörsch, A.K. Maia, D. Rautenbach, I. Sau, FPT algorithms for packing k-safe spanning rooted sub(di)graphs, https://arxiv.org/abs/2105.01582.
3. J. Chuzhoy, M. Parter, Z. Tan, On packing low-diameter spanning trees, https://arxiv.org/abs/2006.07486.
4. Connections in Combinatorial Optimization;Frank,2011
5. F. Illingworth, E. Powierski, A. Scott, Y. Tamitegama, Balancing connected colourings of graphs, https://arxiv.org/abs/2205.04984v1.