10.46298/dmtcs.577https://dmtcs.episciences.org/577Horňák, MirkoMirkoHorňákInstitute of Mathematics [Kosice, Slovakia]0000-0002-3588-8455Woźniak, MariuszMariuszWoźniakOn neighbour-distinguishing colourings from listsGraphs 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.[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Hal authorisation v12015-06-092012-08-162012-08-16engjournal article https://hal.science/hal-00990586v11365-8050open accesshttps://dmtcs.episciences.org/577/pdfVoRapplication/pdfDiscrete Mathematics & Theoretical Computer Sciencevol. 14:2Graph and AlgorithmsResearchersStudents