Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +1

A graph is $(H_1,H_2)$-free for a pair of graphs $H_1,H_2$ if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. In 2001, Král', Kratochv\'ıl, Tuza, and Woeginger initia…