, and C(V ′′ , V ′ ) are pairwise disjoint and form a partition of E(G). Note that in the undirected case, C(V ′ , V ′′ ) = C(V ′′ , V ′ ) since symmetric edges xy and yx are identified in undirected graphs. A cut-set that is inclusion minimal, i.e., that does not contain any other cut-set as a proper cut-set is also called a bond in the graph-theory literature. We will not use this term here to avoid confusions with chemical bonds. By slight abuse of notation we write V (E) := {x | xy ∈ E} ∪ {y | xy ∈ E} for the set of nodes incident with an edge-set E, such as a cut. The removal of the set of edges in a cut C(V ′ , V ′′ ) leads to the formation of two or more connected components. We say a cut is a k-cut, where k is the number of connected components induced by the cut.