Abstract
We survey a number of minor-monotone graph parameters and their relationship to the
complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the known characterizations of
... read more