On the Grundy and b-chromatic numbers of a graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2013

On the Grundy and b-chromatic numbers of a graph

Abstract

The Grundy number of a graph G, denoted by Γ(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 Γ (G) ≤ ∆(G) + 1. In this paper, we show that deciding if Γ (G) ≤ ∆(G) is NP-complete. We then show that deciding if Γ (G) ≥ |V (G)| − k is fixed parameter tractable with respect to the parameter k.
Fichier principal
Vignette du fichier
FPT-dual-greedy.pdf (176.77 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00905927 , version 1 (23-10-2016)

Identifiers

  • HAL Id : hal-00905927 , version 1

Cite

Frédéric Havet, Leonardo Sampaio. On the Grundy and b-chromatic numbers of a graph. Algorithmica, 2013, 65 (4), pp.885-899. ⟨hal-00905927⟩
330 View
163 Download

Share

Gmail Mastodon Facebook X LinkedIn More