There are finitely many $5$-vertex-critical $(P_6,\text{bull})$-free graphs

Yiao Ju, Jorik Jooken, Jan Goedgebeur +1

In this paper, we are interested in $4$-colouring algorithms for graphs that do not contain an induced path on $6$ vertices nor an induced bull, i.e., the graph with vertex set $\{…