Complete combinatorial characterization of greedy-drawable trees

Hiroyuki Miyata, Reiya Nosaka

A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s\ne t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the E…