An improved upper bound for the neighbor sum distinguishing index of graphs

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

Computing, Computer Science, Mathematics +12

Adjacent strong edge coloring of graphs

Zhang Zhong-fu, Linzhong Liu, Jianfang Wang · Applied Mathematics Letters · 2002 · 224 citations

Natural Sciences, Visualization, Combinatorics +8

Adjacent Vertex Distinguishing Edge‐Colorings

Paul Balister, E. Gyo ̋ri, Jenő Lehel et al. · SIAM Journal on Discrete Mathematics · 2007 · 144 citations

Natural Sciences, Evolutionary Biology, Color Theory +9

<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="normal">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number

Hamed Hatami · Journal of Combinatorial Theory Series B · 2005 · 126 citations

Natural Sciences, Mathematics, Combinatorics +5

Neighbor Sum Distinguishing Index

Evelyne Flandrin, Antoni Marczyk, Jakub Przybyło et al. · Graphs and Combinatorics · 2012 · 60 citations · Full text

Natural Sciences, Mathematics, Color Theory +7