Asymptotically optimal neighbour sum distinguishing colourings of graphs
- 9 June 2014
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 47 (4) , 776-791
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Centre (DEC-2011/01/D/ST1/04154)
- Polish Ministry of Science and Higher Education
This publication has 18 references indexed in Scilit:
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- A New Upper Bound for the Irregularity Strength of GraphsSIAM Journal on Discrete Mathematics, 2011
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- is a bound on the adjacent vertex distinguishing edge chromatic numberJournal of Combinatorial Theory, Series B, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- On graph irregularity strengthJournal of Graph Theory, 2002
- Adjacent strong edge coloring of graphsApplied Mathematics Letters, 2002
- Irregular Assignments of Trees and ForestsSIAM Journal on Discrete Mathematics, 1990
- How to Define an Irregular GraphThe College Mathematics Journal, 1988