Hereditary 2-WQO Graph Classes Have Bounded Clique-Width

Julien Duron, Nikolas Mählmann, Szymon Toruńczyk

A graph class is $k$-WQO if its $k$-labeled graphs are well-quasi-ordered under label-preserving induced subgraph embeddings. We show that every hereditary graph class that is $2$-…