Horňák, Mirko and WoźniaK, Mariusz - On neighbour-distinguishing colourings from lists

dmtcs:577 - Discrete Mathematics & Theoretical Computer Science, August 16, 2012, Vol. 14 no. 2
On neighbour-distinguishing colourings from lists

Authors: Horňák, Mirko and WoźniaK, Mariusz

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.


Source : oai:HAL:hal-00990586v1
Volume: Vol. 14 no. 2
Section: Graph and Algorithms
Published on: August 16, 2012
Submitted on: May 25, 2009
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 37 times.
This article's PDF has been downloaded 54 times.