2 datasets found

A proper colouring of a graph is a function that assigns a colour to each vertex with the restriction that adjacent vertices are assigned with distinct colours. Proper...

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...