6 citations · 18 across the 11 of their papers we have counts for
1 paper · 1 filter
T. Karthick, Suchismita Mishra
We show that every (P6, diamond, K4)-free graph is 6-colorable. Moreover, we give an example of a (P6, diamond, K4)-free graph G with χ(G)=6. This generalizes s…