Equitable List Vertex Colourability and Arboricity of Grids

Ewa Drgas-Burchardt, Janusz Dybizbański, Hanna Furmańczyk +1

A graph $G$ is equitably $k$-list arborable if for any $k$-uniform list assignment $L$, there is an equitable $L$-colouring of $G$ whose each colour class induces an acyclic graph.…