A note on weak degeneracy of K3,3-minor-free graphs and K5-minor-free graphs

Source abstract

Bernshteyn and Lee introduced the notion of weak degeneracy. It has been shown that increasing the weak degeneracy by one provides an upper bound for various graph coloring parameters, including DP-chromatic number and Alon–Tarsi number. In this paper, we prove that for any graph [Formula: see text] that is either [Formula: see text]-minor-free or [Formula: see text]-minor-free, we have [Formula: see text].