Neighbor sum distinguishing index of 2-degenerate graphs
- 19 January 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (3) , 798-809
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11171288, 11371193)
This publication has 17 references indexed in Scilit:
- On the Neighbor Sum Distinguishing Index of Planar GraphsJournal of Graph Theory, 2016
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degreeDiscrete Applied Mathematics, 2014
- On Neighbor-Distinguishing Index of Planar GraphsJournal of Graph Theory, 2013
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- Strong Chromatic Index of 2-Degenerate GraphsJournal of Graph Theory, 2012
- Acyclic edge coloring of 2‐degenerate graphsJournal of Graph Theory, 2010
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- On the Neighbour-Distinguishing Index of a GraphGraphs and Combinatorics, 2006
- is a bound on the adjacent vertex distinguishing edge chromatic numberJournal of Combinatorial Theory, Series B, 2005