| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903477 | Electronic Notes in Discrete Mathematics | 2017 | 14 Pages |
Abstract
The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in polynomial time for Cameron graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang,