On the complexity of computing the $k$-restricted edge-connectivity of a graph

Luis Pedro Montejano, Ignasi Sau

The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by ${\lambda }_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components…