Revisiting Extremal Graphs Having No Stable Cutsets

Abstract

Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender showed that all graphs with $n$ vertices and $2n-3$ edges without stable cutset arise from recursively gluing together triangles and triangular prisms along an edge or triangle. Le and Pfender's proof (Electron. J. Combin. 20(1) (2013),  #P54)  contains a gap, which we fill in the present article.