Indexed by：
Abstract：
The Borodin–Kostochka conjecture says that for a graph G, if Δ(G)≥9, then χ(G)≤max{Δ(G)−1,ω(G)}. Cranston and Rabern in [SIAM J. Discrete. Math. 27 (2013) 534–549] proved the conjecture holding for K1,3-free graphs. In this paper, we prove that the conjecture holds for K1,3¯-free graphs, where K1,3¯ denotes the complement of K1,3. © 2024 Elsevier B.V.
Keyword：
Reprint 's Address：
Email：
Source ：
Discrete Applied Mathematics
ISSN： 0166-218X
Year： 2024
Volume： 356
Page： 263-268
1 . 0 0 0
JCR@2023
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：
