On the neighbour-distinguishing index of a graph

Keith Edwards, Mirko Horňák, Mariusz Woźniak

    Research output: Contribution to journalArticlepeer-review

    52 Citations (Scopus)


    A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adjacent vertices by sets of colours of their incident edges. It is proved that for any planar bipartite graph G with ?(G) = 12 there is a neighbour-distinguishing edge colouring of G using at most ?(G)+1 colours. Colourings distinguishing pairs of vertices that satisfy other requirements are also considered.
    Original languageEnglish
    Pages (from-to)341-350
    Number of pages10
    JournalGraphs and Combinatorics
    Issue number3
    Publication statusPublished - 2006


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

    Cite this