On neighbour-distinguishing colourings from listsHorňák, MirkoWoźniak, MariuszAlain MonteilISSN: 1365-8050Discrete Mathematics & Theoretical Computer ScienceEpisciences.orghttps://dmtcs.episciences.org/577info:doi:10.46298/dmtcs.577dmtcs:577 - Discrete Mathematics & Theoretical Computer Science, 2012-08-16, vol. 14:2en[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]info:eu-repo/semantics/openAccessinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articleJournal articlesinfo:eu-repo/semantics/publishedVersionResearchersGraphs and AlgorithmsAn 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.2012-08-16