Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647287 | Discrete Mathematics | 2014 | 11 Pages |
Abstract
The Grundy number of a graph G, denoted by Î(G), is the largest k such that there exists a partition of V(G), into k independent sets V1,â¦,Vk and every vertex of Vi is adjacent to at least one vertex in Vj, for every j
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni,