Obstructions for three-coloring and list three-coloring $H$-free graphs

Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt +1

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free grap…