Solomon Grundy

The Grundy (or First-Fit) chromatic number of a graph G is the maximum number of colors used by the First-Fit coloring of the graph G. In this paper we give upper bounds for the Grundy number of graphs in terms of vertex degrees, girth, clique partition ...

Given a graph G, by a Grundy k-coloring of G we mean any proper k-vertex coloring of G such that for each two colors i and j, i =k, for any fixed integer k and show that it is a polynomial time problem. But in general, Grundy number is an NP-complete ...

The Grundy domination number, γ gr ( G ), of a graph G is the maximum length of a sequence ( v 1 , v 2 , … , v k ) of vertices in G such that for every i ∈ { 2 , … , k }, the closed neighborhood N [ v i ] contains a vertex that does ...