Grundy coloring for power graphs

Electronic Notes in Discrete Mathematics

Volumn 15, Issue , 2003, Pages 65-67

  Germain, Christian ^a   Kheddouci, Hamamache ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27944454698     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00533-5     Document Type: Article

References (2)

1. Christen C.A., and Selkow S.M. Some perfect coloring properties of graphs. J. Combin. Theory B27 (1979) 49-59
2. Hedetniemi S.M., Hedetniemi S.T., and Beyer T. A linear algorithm for the Grundy (coloring) number of a tree. Congr. Numer. 36 (1982) 351-363