Authors: Mirko Horňák ¹; Mariusz WoźniaK

• 1 Institute of Mathematics [Kosice, Slovakia]

Graphs and Algorithms

[en]
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.