Asymptotically Optimal Vertex Ranking of Planar Graphs

Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh +1

A (vertex) $\ell$-ranking is a colouring $\phi :V(G)\to \mathbb{N}$ of the vertices of a graph $G$ with integer colours so that for any path $u_0,\dots ,u_p$ of length at most $\ell$, $…