Article ID Journal Published Year Pages File Type
4651380 Discrete Mathematics 2006 8 Pages PDF
Abstract

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

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Results on the Grundy chromatic number of graphs
Authors
,