Graceful coloring is computationally hard

Cyriac Antony, Laavanya D., Devi Yamini S

Given a (proper) vertex coloring $f$ of a graph $G$, say $f:V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h:E(G)\to \mathbb{N}$ defin…