Automated Testing and Interactive Construction of Unavoidable Sets for Graph Classes of Small Path-width

Oliver Bachtler, Irene Heinrich

We present an interactive framework that, given a membership test for a graph class $\mathcal{G}$ and a number $k$, finds and tests unavoidable sets for the class of graphs in $\ma…