On graphs without four-vertex induced subgraphs

Kathie Cameron, Chính T. Hoà ng, Taite LaGrange

Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of colouring (claw, 4K1)- fr…