The Chromatic Number of -Free Graphs

Abstract

The diamond is the complete graph on four vertices minus one edge; $P_n$ and $C_n$ denote the path and cycle on n vertices, respectively. We prove that the chromatic number of a $(P_6,C_4,\mbox {diamond})$ -free graph G is no larger than the maximum of 3 and the clique number of G.