Independent trees in planar graphs (Q1288514)

Let \(x,y\) be two vertices in a simple, finite graph \(G\). Two paths from \(x\) to \(y\) are called openly disjoint if they only have \(x\) and \(y\) in common. The following theorem is proved. Let \(G\) be a simple finite, \(k\)-connected planar graph and let \(v\) be a vertex of \(G\). Then there exist \(k\) spanning trees \(T_1,\dots,T_k\) in \(G\) such that for each vertex \(x\neq v\), the \(k\) paths from \(x\) to \(v\) in \(T_1, \dots, T_k\) are pairwise openly disjoint.