List-distance consistent vertices in trees are confined to a path

Fei-Huang Chang, Ma-Lian Chia, David Kuo +1

A labeling of a connected graph $G$ on $n$ vertices is a bijection $c:V(G)\to \{1,\dots ,n\}$; writing $c(u,v)=|c(u)-c(v)|$, a vertex $u$ is list-distance consistent if $d(u,v)<d(u,w…