4 papers
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…
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…