Given a set of graphs, a graph is -free if does not contain any graph in as an induced subgraph. There has been keen interest in colouring graphs whose forbidden list contains graphs with four vertices. A recent paper of Lozin and Malyshev (in press) discusses the state of the art on this problem, identifying three outstanding classes: , , and . In this paper we investigate the class of (, , )-free graphs and show that if is a (, , )-free graph, then either has bounded clique width or is perfect.