# New pages

- 11:01, 2 June 2018 Edge-independent spanning trees (hist) [1,893 bytes] Tkiraly (Talk | contribs) (Created page with "<onlyinclude> In a graph ''G=(V,E)'' with a root node ''r'', two spanning trees <math>T_1</math> and <math>T_2</math> are called '''edge-independent''' if for any node ''x'' i...")