Obstructions to $k$-colouring $H$-free graphs

Iain Beaton, Ben Cameron, Adam van Omme

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. In 2020, Chudnovsky, Goedgebeur, Schaudt, and Zhong characterized all graphs $H$ such that there are only finit…