Connecting edge-colouring

06/30/2019

∙

by   Jørgen Bang-Jensen, et al.

∙

0

∙

share

This paper studies the problem of connecting edge-colouring. Given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there exists a properly coloured walk between every pair of vertices of the graph i.e. a walk that does not use consecutively two edges of the same colour. We establish that the problem can be solved in polynomial time in the size of the graph and we provide a characterization of the graphs that can be properly connected with k colours for every possible value of k.