pith. sign in

arxiv: 1604.07128 · v2 · pith:NXFJJZLTnew · submitted 2016-04-25 · 💻 cs.DM · cs.DS

On the Grundy number of Cameron graphs

Wing-Kai Hon , Ton Kloks , Fu-Hong Liu , Hsiang-Hsuan Liu , Tao-Ming Wang This is my paper
classification 💻 cs.DM cs.DS
keywords numbercamerongraphsgrundyclassgraphattainedcographs
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.