Complexity of greedy edge-colouring - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of the Brazilian Computer Society Year : 2015

Complexity of greedy edge-colouring


The Grundy index of a graph G = (V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove that the Grundy index of a caterpillar is (G) or (G) + 1 and present a polynomial-time algorithm to determine it exactly.
Fichier principal
Vignette du fichier
soumis-bresil.pdf (435.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01233312 , version 1 (18-12-2015)



Frédéric Havet, Ana Karolinna Maia de Oliviera, Min-Li Yu. Complexity of greedy edge-colouring. Journal of the Brazilian Computer Society, 2015, 21 (18), ⟨10.1186/s13173-015-0036-x⟩. ⟨hal-01233312⟩
117 View
359 Download



Gmail Facebook Twitter LinkedIn More