Bounding Clique-Width via Perfect Graphs

Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1…