activity
20122023
most citedOn Validity of Reed Conjecture for {P_5, Flag^C}-free graphs

1 citations · 3 across the 15 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

math.CO2013

Tight Chromatic Upper Bound for {3K1, C5}-free Graphs

Medha Dhurandhar

Problem of finding an optimal upper bound for a chromatic no. of 3K1-free graphs is still open and pretty hard. Here we find a tight chromatic upper bound for {3K1, C5}-free graphs…