| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513013 | Discrete Mathematics | 2005 | 9 Pages |
Abstract
A coloring of a graph G=(V,E) is a partition {V1,V2,â¦,Vk} of V into independent sets or color classes. A vertex vâVi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj for every j
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice McRae,