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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
