A Linear Algorithm for the Grundy Number of A Tree
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
Ali Mansouri : Connect in order to contact the contributor
https://inria.hal.science/hal-01114403
Submitted on : Wednesday, February 11, 2015-3:28:32 PM
Last modification on : Tuesday, September 12, 2023-11:49:43 AM
Dates and versions
Licence
Public Domain
Identifiers
- HAL Id : hal-01114403 , version 1
- ARXIV : 1406.0196
- DOI : 10.5121/ijcsit.2014.6112
Cite
Mansouri Ali, Mohamed Salim Bouhlel. A Linear Algorithm for the Grundy Number of A Tree. International Journal of Computer Science and Information Technology, 2014, Volume 6 (1), pp.5. ⟨10.5121/ijcsit.2014.6112⟩. ⟨hal-01114403⟩
38
View
6
Download