Title of article :
General neighbour-distinguishing index of a graph Original Research Article
Author/Authors :
Ervin Gy?ri، نويسنده , , Mirko Hor??k، نويسنده , , Cory Palmer، نويسنده , , Mariusz Wo?niak، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
It is proved that edges of a graph G with no component image can be coloured using at most image colours so that any two adjacent vertices have distinct sets of colours of their incident edges.
Keywords :
Edge colouring , Colour set , General neighbour-distinguishing index
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
