On Stable Cutsets in General and Minimum Degree Constrained Graphs

Mats Vroon, Hans L. Bodlaender

A stable cutset is a set of vertices $S$ of a connected graph, that is pairwise non-adjacent and when deleting $S$, the graph becomes disconnected. Determining the existence of a s…