Wei-Fan Wang

Strict neighbor-distinguishing index of planar graphs without 4-cycles

A proper edge coloring of a graph G is strict neighbor-distinguishing if for any two adjacent vertices u and v, the set of colors used on the edges incident to u and the set of colors used on the edges incident to v are not included with each other. The strict neighbor-distinguishing index of G is the minimum number χs...