Showing 2017Show all
2 papers · 1 filter
math.CO2017
Coloring (, diamond, )-free graphs
T. Karthick, Suchismita Mishra
We show that every (, diamond, )-free graph is -colorable. Moreover, we give an example of a (, diamond, )-free graph with . This generalizes s…
cs.DM2017
Chromatic bounds for some classes of -free graphs
T. Karthick, Suchismita Mishra
A hereditary class of graphs is -bounded if there is a -binding function, say such that , for every , where (…