Indexed by：
Abstract：
For a number l ＞= 2, let G(l) denote the family of graphs which have girth 2l+1 and have no odd hole with length greater than 2l+1. Wu et al. conjectured that every graph in U(l ＞= 2)Gl is 3-colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in G(2) and G(3) is 3-colorable. In this paper, we prove that every graph in U(l ＞= 5)Gl is 3-colorable.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
JOURNAL OF GRAPH THEORY
ISSN： 0364-9024
Year： 2024
Issue： 4
Volume： 108
Page： 661-671
0 . 9 0 0
JCR@2023
CAS Journal Grade：2
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：
