Hereditary system; Comatroid; Steepest descent algorithm; Performance guarantee

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series–parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable outer-planar graphs.