Vertex-distinguishing edge coloring of graphs

Yuping Gao, Songling Shan, Guanghui Wang +1

Let $k\ge 1$ be an integer and let $G$ be a nonempty simple graph. An \emph{edge-$k$-coloring} $\phi$ of $G$ is an assignment of colors from $\{1,\dots ,k\}$ to the edges of $G$ such…