Indexed by：
Abstract：
An odd hole is an induced odd cycle of length at least five. Let ℓ≥ 2 be an integer, and let Gℓ denote the family of graphs which have girth 2 ℓ+ 1 and have no holes of odd length at least 2 ℓ+ 5 . In this paper, we prove that every graph G∈ ∪ ℓ≥3Gℓ is 4-colourable. © 2023, The Author(s), under exclusive licence to Springer Nature Japan KK, part of Springer Nature.
Keyword：
Reprint 's Address：
Email：
Source ：
Graphs and Combinatorics
ISSN： 0911-0119
Year： 2023
Issue： 6
Volume： 39
0 . 6
JCR@2023
0 . 6 0 0
JCR@2023
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：
