
In this talk we will present a new algorithm for generating all minimal forbidden subgraphs to kcolorability for a given graph class. We will also show how it has been applied to fully characterize the forbidden subgraphs for kcolorability of various classes of graphs without long induced paths.
This is joint work with Oliver Schaudt.