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
查看更多>>操作日志
管理员 2024-08-26 02:05:58 更新被引
管理员 2024-07-13 01:59:14 更新被引
管理员 2024-06-20 06:41:47 更新被引
管理员 2022-12-28 19:52:43 追加