Grundy number of graphs
نویسندگان
چکیده
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i− 1) vertices colored with each color j, 1 ≤ j ≤ i− 1. In this paper we give bounds for the Grundy number of some graphs and cartesian products of graphs. In particular, we determine an exact value of this parameter for n-dimensional meshes and some n-dimensional toroidal meshes. Finally, we present an algorithm to generate all graphs for a given Grundy number.
منابع مشابه
Results on the Grundy chromatic number of graphs
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 < j , every vertex ofG colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by (G) and called Grundy (chromatic) number of G. We first discuss the fixed-parameter complexity of determining (G) k, for any fixed in...
متن کاملExact values for the Grundy number of some graphs
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i 1) vertices colored with each color j, 1 ≤ j ≤ i 1. In this paper we give bounds for the Grundy number of some graphs and Cartesian products of graphs. In particular, we determine an exact value of...
متن کاملComplexity of Grundy Coloring and Its Variants
The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of Grundy Coloring, the problem of determining whether a given graph has Grundy number at least k. We also study the variants Weak Grundy Coloring (where the coloring is not necessarily proper) and Connected Grundy Col...
متن کاملOn the Grundy number of graphs with few P4's
The Grundy number of a graph G is the largest number of colors used by any execution of the greedy algorithm to color G. The problem of determining the Grundy number of G is polynomial if G is a P 4-free graph and N P-hard if G is a P 5-free graph. In this article, we define a new class of graphs, the fat-extended P 4-laden graphs, and we show a polynomial time algorithm to determine the Grundy...
متن کاملOn the Grundy number of Cameron graphs
TheGrundynumber of a graph is themaximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in polynomial time for Cameron graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 27 شماره
صفحات -
تاریخ انتشار 2007