On the Grundy number of Cameron graphs
Discrete Mathematics
2016-07-15 v2 Data Structures and Algorithms
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
Cite
@article{arxiv.1604.07128,
title = {On the Grundy number of Cameron graphs},
author = {Wing-Kai Hon and Ton Kloks and Fu-Hong Liu and Hsiang-Hsuan Liu and Tao-Ming Wang},
journal= {arXiv preprint arXiv:1604.07128},
year = {2016}
}