List-antimagic labeling of vertex-weighted graphs

Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam +2

A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega :V(G)\to \mathbb{R}$ and any list assignment $L:E(G)\to 2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|…