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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.