most citedBounds for the Grundy chromatic number of graphs in terms of domination number

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

collaborators

2 papers

math.CO2023★ 2 cited

More results on the -chromatic number of graphs

Abbas Khaleghi, Manouchehr Zaker

By a -coloring of a graph we mean any proper vertex coloring consisting of the color classes such that for any two colors and with $1 \leq i…

math.CO2022★ 3 cited

Bounds for the Grundy chromatic number of graphs in terms of domination number

Abbas Khaleghi, Manouchehr Zaker

For any graph , the Grundy (or First-Fit) chromatic number of , denoted by (also ), is defined as the maximum number of colors used by the First-Fit…