1 citations · 3 across the 7 of their papers we have counts for
9 papers
Validity of Borodin and Kostochka Conjecture for classes of graphs without a single, forbidden subgraph on 5 vertices
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…
On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs
Medha Dhurandhar
Reed Conjecture is open for more than 20 years now. Here we prove that Reed Conjecture is valid for (1) {P4UnionK1, Kite}-free graphs (2) {Chair, Kite}-free graphs (3) {K2UnionK2co…
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…
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…