1. Frank, A. (2011) Connections in Combinatorial Optimization. Oxford University Press, Oxford.
2. Illingworth, F., Powierski, E., Scott, A. and Tamitegama, Y. (2012) Balancing Connected Colourings of Graphs. arxiv.org, 2205.04984.
3. Edge-Disjoint Spanning Trees of Finite Graphs
4. On the Problem of Decomposing a Graph into n
Connected Factors
5. Florian, H. (2022) Globally Balancing Spanning Trees. arxiv.org, 2110.13726.