Skip to Main content Skip to Navigation
Journal articles

On neighbour-distinguishing colourings from lists

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990586
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 4:27:35 PM
Last modification on : Thursday, October 4, 2018 - 10:12:02 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:41:50 PM

File

1319-7351-2-PB.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

58

Files downloads

647