Logo image
Back
On the Grundy number of Cameron graphs
Journal article

On the Grundy number of Cameron graphs

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu and Tao-Ming Wang
Electronic Notes in Discrete Mathematics, Vol.63, pp.503-516
12/2017
DOI: https://doi.org/10.1016/j.endm.2017.11.049

Abstract

Cameron graphs coloring Grundy number Discrete Mathematics and Combinatorics Applied Mathematics
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.

Metrics

1 Record Views

Details

Logo image