Indexed by：
Abstract：
The diamond is the complete graph on four vertices minus one edge; Pn and Cn denote the path and cycle on n vertices, respectively. We prove that the chromatic number of a (P6,C4, diamond)-free graph G is no larger than the maximum of 3 and the clique number of G. © The Author(s), 2022. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.
Keyword：
Reprint 's Address：
Email：
Source ：
Bulletin of the Australian Mathematical Society
ISSN： 0004-9727
Year： 2023
Issue： 1
Volume： 108
Page： 1-10
0 . 6
JCR@2023
0 . 6 0 0
JCR@2023
ESI HC Threshold：13
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
