activity
20212023
most cited-binding functions for some classes of -free graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 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…

math.CO2022★ 1 cited

-binding functions for some classes of -free graphs

Athmakoori Prashant, P. Francis, S. Francis Raj

The class of -free graphs have been well studied in various contexts in the past. It is known that the class of -free graphs and $\{2K_2,(K_1\cup K_2)+K_p\…

math.CO2021

Chromatic bounds for the subclasses of -free graphs

Athmakoori Prashant, S. Francis Raj, M. Gokulnath

The concept of -binding functions for classes of free graphs has been extensively studied in the past. In this paper, we improve the existing -binding function for $\{2K_2, K…