4 papers
Families of Linearly -bounded Graphs without Chair or its Induced Sub-graphs
Medha Dhurandhar
A hereditary class H of graphs is -bounded if there is a -binding function f such that for every in , less than or equal to . Here we prove that if a g…
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…
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,…
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…