1 citations · 3 across the 15 of their papers we have counts for
4 papers · 1 filter
On Validity of Reed Conjecture for {P_5, Flag^C}-free graphs
Medha Dhurandhar
Here we prove that Reed Conjecture is valid for {P5, Flag_Complement}-free graphs where FlagComplement is the complement of the Flag graph. Some of the known results follow as coro…
Validity of Borodin & Kostochka Conjecture for a Class of Graphs
Medha Dhurandhar
Borodin & Kostochka conjectured that if maximum degree of a graph is greater than or equal to 9, then the chromatic number of the graph is less than or equal to maximum of ω and ma…
Improvement on Brook theorem for (3 Times K1)-free Graphs
Medha Dhurandhar
Problem of finding an optimal upper bound for the chromatic no. of a (3 Times K1)-free graph is still open and pretty hard. Here we prove that for a (3 Times K1)-free graph G with…
Improvement on Brook theorem for 2K2-free Graphs
Medha Dhurandhar
Here we prove that for a 2K2-free graph G with maximum degree greater than or equal to 5, the chromatic number is less than or equal to max{maximum degree-1, maximum clique size}.…