Stability of Hereditary Graph Classes Under Closure Operations
If is a subclass of the class of claw-free graphs, then is said to be stable if, for any , the local completion of G at any vertex is also in . If is a closure operation that turns a claw-free graph into a line graph by a series of local completions and is stable, then for any . In this article, we study stability of hereditary classes of claw-free graphs defined in terms of a family of connected closed forbidden subgraphs. We characterize line graph preimages of graphs in families that yield stable classes, we identify minimal families that yield stable classes in the finite case, and we also give a general background for techniques for handling unstable classes by proving that their closure may be included into another (possibly stable) class.
closure forbidden subgraph stable class