1 citations · 3 across the 15 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Tight Chromatic Upper Bound for {3 Times K1, {2 Times K1 + (K2 UNION K1)}-free Graphs
Medha Dhurandhar
Problem of finding an optimal upper bound for χ of (3 Times K1)-free graphs is still open and pretty hard. It was proved by Choudum et al that upper bound on the χ of {3 Times K1,…
math.CO2014
Tight Chromatic Upper Bound for {3K1, K1+C4}-free Graphs
Medha Dhurandhar
Problem of finding an optimal upper bound for the chromatic no. of 3K1-free graphs is still open and pretty hard. It was proved by Choudum et al that an upper bound on the chromati…