Generation of vertex and mixed cutsets in a graph

The paper considers the interchange graph I(G) of a given, finite, connected, undirected graph G without loops and multiple edges and shows that the vertex and mixed cutsets can be defined by a class of minimal-edge cutsets of I(G). Some remarks are made concerning the computation of vertex and mixed cutsets in a vertex- and edge-weighted communication network.