  The generalized coloring numbers col_r(G) (also denoted by scol_r(G)) and
wcol_r(G) of a graph G were introduced by Kierstead and Yang as a
generalization of the usual coloring number, and have found important
theoretical and algorithmic applications. For each distance r, these numbers
are determined by an "optimal" ordering of the vertices of G. We study the
question of whether it is possible to find a single "uniform" ordering that is
"good" for all distances r. We show that the answer to this question is
essentially "yes". Our results give new characterizations of graph classes with
bounded expansion and nowhere dense graph classes.
