Cite
HARVARD Citation
Przybyło, J. (2015). Asymptotically optimal neighbour sum distinguishing colourings of graphs1. Random structures & algorithms. 47 (4), pp. 776-791. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Przybyło, J. (2015). Asymptotically optimal neighbour sum distinguishing colourings of graphs1. Random structures & algorithms. 47 (4), pp. 776-791. [Online].