Edge-disjoint paths, disconnecting sets of edges, vertex-disjoint paths, disconnecting set of vertices, local edge-connectivity X(x, y), X'(x,y), and local vertex-connectivity k(x, y), k'(x, y), Theorems on connection of above with network flows in directed and undirected graphs.
10