Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-01114403
Contributor : Ali Mansouri <>
Submitted on : Wednesday, February 11, 2015 - 3:28:32 PM
Last modification on : Tuesday, June 23, 2020 - 12:30:04 PM

Licence


Public Domain

Links full text

Identifiers

Citation

Mansouri Ali, Mohamed Salim Bouhlel. A Linear Algorithm for the Grundy Number of A Tree. International journal of computer science & information technology (IJCSIT), 2014, Volume 6 (1), pp.5. ⟨10.5121/ijcsit.2014.6112⟩. ⟨hal-01114403⟩

Share

Metrics

Record views

59