1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Hoboken (1993)
2. Aprile, M., Fiorini, S., Huynh, T., Joret, G., Wood, D.R.: Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. Electron. J. Comb. 28, P4-47 (2021)
3. Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J.P., Weintraub, A.: Imposing connectivity constraints in forest planning models. Oper. Res. 61(4), 824–836 (2013)
4. Cygan, M., Fomin, F.V., Kowalik, Ł, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)
5. DeFord, D., Najt, L., Stucky, E.: PlanarEmbeddings (2019). https://github.com/vrdi/NetworksWeek5/tree/master/PlanarEmbeddings