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 Δ(G)≥9, we have χ(G)≤max{Δ(G)−1,ω(G)}. We show that this conjecture holds for {P2∪P3,house}-free graphs. © 2023 Elsevier B.V.
Keyword：
Reprint 's Address：
Email：
Source ：
Discrete Applied Mathematics
ISSN： 0166-218X
Year： 2024
Volume： 342
Page： 12-18
1 . 0 0 0
JCR@2023
Cited Count：
WoS CC Cited Count： 3
SCOPUS Cited Count： 1
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
