Indexed by：
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, diamond)-free graph G is no larger than the maximum of 3 and the clique number of G.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY
ISSN： 0004-9727
Year： 2022
0 . 7
JCR@2022
0 . 6 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：24
JCR Journal Grade：3
CAS Journal Grade：4
