On the Grundy number of a graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2010

On the Grundy number of a graph


The Grundy number of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a greedy $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. Trivially $\Gamma(G)\leq \Delta(G)+1$. In this paper, we show that deciding if $\Gamma(G)\leq \Delta(G)$ is NP-complete. We then show that deciding if $\Gamma(G)\geq |V(G)|-k$ is fixed parameter tractable with respect to the parameter $k$.
Fichier principal
Vignette du fichier
FPT-dual-greedy.pdf (144.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00532906 , version 1 (05-11-2010)



Frédéric Havet, Leonardo Sampaio. On the Grundy number of a graph. Fifth International Symposium on Parameterized and Exact Computation (IPEC 2010), Dec 2010, Chennai, India. pp.170--179, ⟨10.1007/978-3-642-17493-3⟩. ⟨inria-00532906⟩
194 View
147 Download



Gmail Facebook Twitter LinkedIn More