Equitable $d$-degenerate choosability of graphs

E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz

Let ${\mathcal{D}}_d$ be the class of $d$-degenerate graphs and let $L$ be a list assignment for a graph $G$. A colouring of $G$ such that every vertex receives a colour from its li…