Sciweavers

DM
2008

General neighbour-distinguishing index of a graph

13 years 3 months ago
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.
Ervin Györi, Mirko Hornák, Cory Palmer
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DM
Authors Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
Comments (0)