文章基本信息

标题：A Linear Algorithm for the Grundy Number of A Tree
本地全文：下载
作者：Ali Mansouri ; Mohamed Salim Bouhlel
期刊名称：International Journal of Computer Science & Information Technology (IJCSIT)
印刷版ISSN：0975-4660
电子版ISSN：0975-3826
出版年度：2014
卷号：6
期号：1
页码：155
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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
关键词：Graphs; Grundy Number; Algorithm ; Linear-time algorithm ; Coloring of a graph.