$k$-Critical Graphs in $P_5$-Free Graphs

Kathie Cameron, Jan Goedgebeur, Shenwei Huang +1

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices. A graph $G…