Some Results on Critical ($P_5,H$)-free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +1

Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper i…