On neighbour-distinguishing colourings from lists - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

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.
Fichier principal
Vignette du fichier
1319-7351-2-PB.pdf (262.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990586 , version 1 (13-05-2014)

Identifiers

Cite

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⟩

Collections

TDS-MACS
60 View
783 Download

Altmetric

Share

Gmail Facebook X LinkedIn More