1 paper
Hamed Hatami
An adjacent vertex distinguishing edge-coloring or an \avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set…