Critical ($P_5$,bull)-free graphs

Shenwei Huang, Jiawei Li, Wen Xia

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$ or $H_2$. Let $P_t$ and $C_t$ be the path and the cycle on $t$…