Opening book details…
Can I read An algorithm for partial Grundy number on trees on EtoBox?
An algorithm for partial Grundy number on trees by Zhengnan Shi; Wayne Goddard; Stephen T. Hedetniemi; Ken Kennedy; Renu Laskar; Alice McRae is a Computer Science article available to read on EtoBox.
What is An algorithm for partial Grundy number on trees about?
A coloring of a graph G = (V , E) is a partition {V 1 , V 2 , . . . , V k } of V into independent sets or color classes. A vertex v ∈ V i is a Grundy vertex if it is adjacent to at least one vertex in each color class V j for every j < i. A coloring is a partial Grundy coloring if every color class contains at least one Grundy vertex, and the partial Grundy number of a graph is the maximum number of colors in a partial Grundy coloring. We derive a natural upper bound on this parameter and show that graphs with sufficiently large girth achieve equality in the bound. In particular, this gives a linear-time algorithm to determine the partial Grundy number of a tree.
Who reads An algorithm for partial Grundy number on trees?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Zhengnan Shi; Wayne Goddard; Stephen T. Hedetniemi; Ken Kennedy; Renu Laskar; Alice McRae
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2005
- Language
- EN
- Field
- Computer Science (Physical Sciences)