Asymptotically optimal neighbour sum distinguishing colourings of graphs

Jakub Przybylo. Asymptotically optimal neighbour sum distinguishing colourings of graphs. Random Struct. Algorithms, 47(4):776-791, 2015. [doi]

@article{Przybylo15,
  title = {Asymptotically optimal neighbour sum distinguishing colourings of graphs},
  author = {Jakub Przybylo},
  year = {2015},
  doi = {10.1002/rsa.20553},
  url = {http://dx.doi.org/10.1002/rsa.20553},
  researchr = {https://researchr.org/publication/Przybylo15},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {47},
  number = {4},
  pages = {776-791},
}