Some results on critical \((P_5, H)\)-free graphs (Q6949552)

The authors' work is inspired by a result concerning the characterization of infinitely many \(k\)-vertex critical \((P_5, H )\) free graphs, where \(H\) is a graph of order four and \(k\geq 5\) is a fixed integer done by \textit{K. Cameron} et al. [Theor. Comput. Sci. 864, 80--91 (2021; Zbl 1502.05057)]. Here, the authors establish the existence of (a) finitely many \(k\) vertex critical \((P_5, K_1,4 +P_1)\) free graphs for \(k\geq 1\), (b) finitely many \(k\) vertex critical \((P_5, K_1,5 +P_1)\) free graphs for \(k\geq 1\), (c) finitely many \(k\) vertex critical \((P_5, (K_3 + 2P_1)^c)\) free graphs for \(k\geq 1\).