On neighbour-distinguishing colourings from lists
Mirko Horňák, Mariusz Woźniak · Discrete Mathematics & Theoretical Computer Science · 2012
Graphs and Algorithms An edge colouring of a graph is said to be neighbour-distinguishing if any two adjacent vertices have distinct sets of colours of their incident edges. In this paper the list version of the problem of determining the minimum number of colours in a neighbour-distinguishing colouring of a given graph is considered.