3 papers
math.CO2023
An optimal chromatic bound for the class of -free graphs
Athmakoori Prashant, S. Francis Raj
In 1987, A. Gyárfás in his paper ``Problems from the world surrounding perfect graphs'' posed the problem of determining the smallest -binding function for $\mathcal{G}(F,\overl…
math.CO2023
Linear -binding functions for -free graphs
Athmakoori Prashant, S. Francis Raj, M. Gokulnath
Finding families that admit a linear -binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of $2K_…
math.CO2022
-binding function for a superclass of -free graphs
Athmakoori Prashant, S. Francis Raj
The class of -free graphs has been well studied in various contexts in the past. In this paper, we study the chromatic number of -free graphs, a superc…