On the parameterized complexity of computing good edge-labelings

Davi de Andrade, Júlio Araújo, Laure Morelle +2

A good edge-labeling (gel for short) of a graph $G$ is a function $\lambda :E(G)\to \mathbb{R}$ such that, for any ordered pair of vertices $(x,y)$ of $G$, there do not exist two disti…