Given two graphs H1 and H2, a graph is (H1,H2)-free if it contains no induced subgraph isomorphic to H1 or H2. Let Pt and Ct be the path and the cycle on t vertices, respectively. A bull is the graph obtained from a triangle with two disjoint pendant edges. In this paper, we show that there are finitely many 5-vertex-critical (P5,bull)-free graphs.
@article{arxiv.2211.04179,
title = {Critical ($P_5$,bull)-free graphs},
author = {Shenwei Huang and Jiawei Li and Wen Xia},
journal= {arXiv preprint arXiv:2211.04179},
year = {2022}
}