Changes

This has been disproved by Péterfalvi<ref name="Pe"/> by showing that for any ''k'' there exist a ''k''-connected graph not containing two strongly independent spanning trees.

==References==