1 citations · 3 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
On the Tight Chromatic Bounds for a Class of Graphs without Three Induced Subgraphs
Medha Dhurandhar
Here we prove that a graph without some three induced subgraphs has chromatic number at the most equal to its maximum clique size plus one. Further we show that the bounds are tigh…
math.CO2016
Tight Chromatic Number for a class of Graphs with two forbidden subgraphs
Medha Dhurandhar
Although the chromatic number of a graph is not known in general, attempts have been made to find good bounds for the number. Here we prove that for a graph G with two forbidden su…