Neighbor-sum-distinguishing edge choosability of subcubic graphs
Authors:
- 27 December 2016
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (3) , 742-759
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Neighbor-sum-distinguishing edge choosability of subcubic graphsJournal of Combinatorial Optimization, 2016
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz RevisitedJournal of Graph Theory, 2014
- Neighbor sum distinguishing index of planar graphsDiscrete Mathematics, 2014
- An improved upper bound for the neighbor sum distinguishing index of graphsDiscrete Applied Mathematics, 2014
- Asymptotically optimal neighbour sum distinguishing colourings of graphsRandom Structures & Algorithms, 2014
- Neighbor Distinguishing Edge Colorings via the Combinatorial NullstellensatzSIAM Journal on Discrete Mathematics, 2013
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degreeJournal of Combinatorial Optimization, 2008
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999