On neighbour-distinguishing colourings from lists

Mirko Horňák (1) , Mariusz Woźniak (2)

1 Institute of Mathematics [Kosice, Slovakia]
2 Faculty of Applied Mathematics [Krakow]

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.

Domaines: Mathématique discrète [cs.DM]

Mirko Horňák, Mariusz Woźniak. On neighbour-distinguishing colourings from lists. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 2 (2), pp.21--28. ⟨10.46298/dmtcs.577⟩. ⟨hal-00990586⟩