1 paper · 1 filter
John Iacono, Piotr Micek, Pat Morin +1
An ℓ-vertex-ranking of a graph G is a colouring of the vertices of G with integer colours so that in any connected subgraph H of G with diameter at most ℓ, there…