General neighbour-distinguishing index of a graph

  title={General neighbour-distinguishing index of a graph},
  author={Ervin Gy{\"o}ri and Mirko Horn{\'a}k and Cory Palmer and Mariusz Wozniak},
  journal={Discrete Mathematics},
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges. © 2007 Elsevier B.V. All rights reserved. 
Highly Cited
This paper has 18 citations. REVIEW CITATIONS