Abstract
AbstractThe Borodin–Kostochka Conjecture states that for a graph , if and , then . We prove the Borodin–Kostochka Conjecture for ‐free graphs, that is, graphs with no induced and no induced .
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
