Dispersed graph labellings

William J. Martin, Douglas R. Stinson

A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1,\dots ,n$ such that $d(i,i+1)\ge k$ for $1\le i\le n-1$. $…