A Linear Algorithm for the Grundy Number of A Tree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computer Science and Information Technology Year : 2014

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

Dates and versions

hal-01114403 , version 1 (11-02-2015)

Licence

Public Domain

Identifiers

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More