General neighbour-distinguishing index of a graph

Ervin Gyori, Mirko Horňák, Cory Palmer, Mariusz Woźniak

Research output: Contribution to journalArticlepeer-review

31 Scopus citations


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.

Original languageEnglish
Pages (from-to)827-831
Number of pages5
JournalDiscrete Mathematics
Issue number5-6
StatePublished - Mar 28 2008


  • Colour set
  • Edge colouring
  • General neighbour-distinguishing index


Dive into the research topics of 'General neighbour-distinguishing index of a graph'. Together they form a unique fingerprint.

Cite this