Lemma 2.3  ([1]})
Let \(G\)  be a \(k\) -connected graph, and let \(x\)  and \(y\)  be a pair of distinct vertices of \(G\) . Then there exists \(k\)  internally disjoint (\(x,y\) )-paths in \(G\) .

