The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable
scientific article; zbMATH DE number 7343952
scientific article