1 citations · 1 across the 4 of their papers we have counts for
6 papers · 1 filter
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…
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_…
-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\…
Bounds for the b-chromatic number of powers of hypercubes
P. Francis, S. Francis Raj, M. Gokulnath
The b-chromatic number of a graph is the maximum for which has a proper vertex coloring using colors such that each color class contains at least one vertex…
On indicated coloring of lexicographic product of graphs
P. Francis, S. Francis Raj, M. Gokulnath
Indicated coloring is a graph coloring game in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a ver…
On indicated coloring of some classes of graphs
P. Francis, S. Francis Raj, M. Gokulnath
Indicated coloring is a type of game coloring in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a v…