Lemma 2.5  ([1]})
Let \(G\)  be a \(k\) -connected graph, and let \(X\)  and \(Y\)  be subsets of \(V(G)\)  of cardinality at least \(k\) . Then there exists a family of \(k\)  pairwise disjoint (\(X,Y\) )-paths in \(G\) .

