On 3-colourability of $(bull,H)$-free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$-colourability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where $bull$ is the graph consisting of $K_3$ with two pendant…