Some results on total weight choosability

T. Wu, J. Luo, Y. Gao

A graph $G=(V,E)$ is called $(k,k^{\prime })$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$…