Abstract
A graph G = (V,E) is connected if for every pair of vertices u and v in V there is a path from u to v in G; if there isn't, we say that G is disconnected. A graph is k-connected if it has more than k vertices and the removal of any k' < k vertices does not disconnect it.In 1963, Tutte showed that for every 3-connected graph G and any pair of vertices u,v in V(G) there is a path P from u t…