Classes of graphs without star forests and related graphs

This work provides a structural characterisation of hereditary graph classes that do not contain star forest, several graphs obtained from forests by subset complementation, union cliques, and the complement cliques as induced subgraphs. provides, for instance, results containing matching complements matching. In terms speed classes, our imply all such have at most factorial growth.