Celina de Figueiredo, Marisa Gutierrez, Prof Fabio Protti, Claudia Sales
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-h...
Citation:
Journal of the Brazilian Computer Society
2015
21:18