1 citations · 3 across the 15 of their papers we have counts for
1 paper · 1 filter
Medha Dhurandhar
Problem of finding an optimal upper bound for the chromatic no. of a graph is still open and very hard. Borodin and Kostochka Conjecture is still open and if proved will improve Br…