Informatics Publishing Limited

Ali Mansouri ¹, Mohamed Salim Bouhlel ¹

Affiliations
1 Department of Electronic Technologies of Information and Telecommunications, Sfax, TN

Abstract

A coloring of a graph G = (V, E) is a partition {V₁, V₂, . . . , V_k} of V into independent sets or color classes. A vertex v ∈ V_i is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj for every j<i. A coloring is a Grundy coloring if every color class contains at least one Grundy vertex, and the Grundy number of a graph is the maximum number of colors in a Grundy coloring. We derive a natural upper bound on this parameter and show that graphs with sufficiently large girth achieve equality in the bound. In particular, this gives a linear-time algorithm to determine the Grundy number of a tree.

Keywords

Graphs, Grundy Number, Algorithm , Linear-Time Algorithm , Coloring of a Graph.

Full Text