Menu
A vertex set \(U \subset V\) in a connected graph \(G = (V, E)\) is a cutset if \(G – U\) is disconnected. If no proper subset of \(U\) is also a cutset of \(G\), then \(U\) is a minimal cutset. An \(\mathcal{MVC}\)-partition \(\pi = \{V_1, V_2, \dots, V_k\}\) of the vertex set \(V(G)\) of a connected graph \(G\) is a partition of \(V(G)\).