Representation of short distances in structurally sparse graphs

Zdeněk Dvořák

A partial orientation $\vec{H}$ of a graph $G$ is a weak $r$-guidance system if for any two vertices at distance at most $r$ in $G$, there exists a shortest path $P$ between them s…