General neighbour-distinguishing index of a graph

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.

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
• Keywords: Colours, DM 2008