Title of article :
On the equality of the partial Grundy and upper ochromatic numbers of graphs Original Research Article
Author/Authors :
Paul Erdos and Janos Suranyi، نويسنده , , Stephen T. Hedetniemi، نويسنده , , Renu C. Laskar، نويسنده , , Geert C.E. Prins، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
12
From page :
53
To page :
64
Abstract :
A (proper) k-coloring of a graph G is a partition Π={V1,V2,…,Vk} of V(G) into k independent sets, called color classes. In a k-coloring Π, a vertex v∈Vi is called a Grundy vertex if v is adjacent to at least one vertex in color class Vj, for every j, j
Keywords :
Achromatic number , Chromatic number , Colorings , Grundy number
Journal title :
Discrete Mathematics
Serial Year :
2003
Journal title :
Discrete Mathematics
Record number :
949296
Link To Document :
