On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs

Chính T. Hoà ng, Ramin Javadi, Nicolas Trotignon

Determining the complexity of colouring ($4K_1,C_4$)-free graph is a long open problem. Recently Penev showed that there is a polynomial-time algorithm to colour a ($4K_1, C_4, C_…