2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/113573Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.17 pages, 5 figures, 2 tablesDiscrete MathematicsComputational ComplexityG.2.2; F.2.2text