General neighbour-distinguishing index of a graph

It is proved that edges of a graph G   with no component K2K2 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.