A note on neighbour-distinguishing regular graphs total-weighting (Q1010694)

Summary: We investigate the following modification of a problem posed by \textit{M. Karoński}, \textit{T. Łuczak} and \textit{A. Thomason} [J. Comb. Theory, Ser. B 91, No.\,1, 151--157 (2004; Zbl 1042.05045)]. Let us assign positive integers to the edges and vertices of a simple graph \(G\). As a result we obtain a vertex-colouring of \(G\) by sums of weights assigned to the vertex and its adjacent edges. Can we obtain a proper colouring using only weights 1 and 2 for an arbitrary \(G\)? We know that the answer is yes if \(G\) is a 3-colourable, complete or 4-regular graph. Moreover, it is enough to use weights from 1 to \(11\), as well as from 1 to \(\lfloor{\chi(G)\over2}\rfloor+1\), for an arbitrary graph \(G\). Here we show that weights from 1 to 7 are enough for all regular graphs.