Abstract
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.
Publisher
Cambridge University Press (CUP)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献