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

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

Authors: Mirko Horňák ORCID-iD1; Mariusz WoźniaK

  • 1 Institute of Mathematics [Kosice, Slovakia]

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.

Volume: Vol. 14 no. 2
Section: Graph and Algorithms
Published on: August 16, 2012
Accepted on: June 9, 2015
Submitted on: May 25, 2009
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0893-9659(02)80015-5
  • 10.1016/s0893-9659(02)80015-5
Adjacent strong edge coloring of graphs

Consultation statistics

This page has been seen 221 times.
This article's PDF has been downloaded 196 times.