Journal of Combinatorial Optimization

, Volume 28, Issue 2, pp 348-357

First online:

Open Access This content is freely available online to anyone, anywhere at any time.

On colour-blind distinguishing colour pallets in regular graphs

  • Jakub PrzybyłoAffiliated withAGH University of Science and Technology Email author 


Consider a graph \(G=(V,E)\) and a colouring of its edges with \(k\) colours. Then every vertex \(v\in V\) is associated with a ‘pallet’ of incident colours together with their frequencies, which sum up to the degree of \(v\). We say that two vertices have distinct pallets if they differ in frequency of at least one colour. This is always the case if these vertices have distinct degrees. We consider an apparently the worse case, when \(G\) is regular. Suppose further that this coloured graph is being examined by a person who cannot name any given colour, but distinguishes one from another. Could we colour the edges of \(G\) so that a person suffering from such colour-blindness is certain that colour pallets of every two adjacent vertices are distinct? Using the Lopsided Lovász Local Lemma, we prove that it is possible using 15 colours for every \(d\)-regular graph with \(d\ge 960\).


Neighbour-distinguishing colouring Lopsided Lovász Local Lemma Colour pallet