Colouring graphs with no induced six-vertex path or diamond

Jan Goedgebeur, Shenwei Huang, Yiao Ju +1

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is ($P_6$, diamond)-free if it contains no induced subgraph isomorphic to a six…