Validity of Borodin and Kostochka Conjecture for {4 Times K1}-free Graphs

Medha Dhurandhar

Problem of finding an optimal upper bound for the chromatic no. of even 3K1-free graphs is still open and pretty hard. Here we prove Borodin & Kostochka Conjecture for 4K1-free gra…