Indexed by：
Abstract：
A house is the graph that consists of an induced 4-vertex cycle and a single vertex with precisely two adjacent neighbors on the cycle. The Borodin-Kostochka Conjecture states that for each graph G with increment Delta(G) ＞= 9, we have chi(G) ＜ max{ increment Delta(G) - 1, omega(G)}. We show that this conjecture holds for {P-2 U P-3, house}-free graphs. (c) 2023 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE APPLIED MATHEMATICS
ISSN： 0166-218X
Year： 2023
Volume： 342
Page： 12-18
1 . 0
JCR@2023
1 . 0 0 0
JCR@2023
JCR Journal Grade：3
CAS Journal Grade：3
Cited Count：
SCOPUS Cited Count： 1
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
