A note on asymptotically optimal neighbour sum distinguishing colourings
Author:
- Jakub PrzybyłoJPJakub Przybyło
- 1 March 2019
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 77, 49-56
Abstract
No abstract availableFunding Information
- National Science Centre (2014/13/B/ST1/01855)
- Ministry of Science and Higher Education
This publication has 39 references indexed in Scilit:
- On the Neighbor Sum Distinguishing Index of Planar GraphsJournal of Graph Theory, 2016
- The adjacent vertex distinguishing total chromatic numberDiscrete Mathematics, 2012
- Irregularity strength of dense graphsJournal of Graph Theory, 2008
- Degree constrained subgraphsDiscrete Applied Mathematics, 2008
- Vertex-Colouring Edge-WeightingsCombinatorica, 2007
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- On the irregularity strength of treesJournal of Graph Theory, 2004
- Irregular Assignments of Trees and ForestsSIAM Journal on Discrete Mathematics, 1990
- How to Define an Irregular GraphThe College Mathematics Journal, 1988