@Article{Taczuk2004,
author = "Taczuk, Karolina and Woźniak, Mariusz",
title = "A note on the vertex-distinguishing index for some cubic graphs",
journal = "Opuscula Math.",
year = "2004",
volume = "24",
number = "2",
pages = "223--229",
doi = "http://dx.doi.org/10.7494/OpMath.2004.24.2.223",
url = "http://dx.doi.org/10.7494/OpMath.2004.24.2.223",
abstract = "The vertex-distinguishing index of a graph \(G\) (\(\operatorname{vdi}(G)\)) is the minimum number of colours required to colour properly the edges of a graph in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some families of cubic graphs.",
keywords = "edge colouring, vertex-distinguishing colouring, cubic graphs",
issn = "1232-9274"
}