On the generalized coloring numbers
On the generalized coloring numbers
The \emph{coloring number} $\mathrm{col}(G)$ of a graph $G$, which is equal to the \emph{degeneracy} of $G$ plus one, provides a very useful measure for the uniform sparsity of $G$. The coloring number is generalized by three series of measures, the \emph{generalized coloring numbers}. These are the \emph{$r$-admissibility} $\mathrm{adm}_r(G)$, the \emph{strong …