Sterboul-Deming Graphs: Characterizations
This paper characterizes Sterboul–Deming graphs—defined as graphs where every vertex belongs to a posy or a flower—by providing constructive decomposition algorithms for graphs with perfect or unique perfect matchings, extending the analysis via Gallai–Edmonds decomposition, and demonstrating that the class encompasses all graphs possessing a -factor.