1 paper · 1 filter
Sylvain Gravier, Hippolyte Signargout, Souad Slimani
A k-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident…