# Element-connectivity

Let G=(V,E) be an undirected graph, and $T \subseteq V$ a set of nodes that will be called terminal nodes. The nodes not in T are called Steiner nodes. The elements of G are the edges and the Steiner nodes. The graph G is k-element-connected if there are k element-disjoint paths between any two terminal nodes.