For any fixed integers d and ℓ, the ℓ-vertex-ranking number of n-vertex d-degenerate graphs is bounded by O(n^(1-2/(ℓ+1)) log n) for even ℓ and O(n^(1-2/ℓ) log n) for odd ℓ.
