The list-coloring function of signed graphs

Sumin Huang, Jianguo Qian, Wei Wang

It is known that, for any $k$-list assignment $L$ of a graph $G$, the number of $L$-list colorings of $G$ is at least the number of the proper $k$-colorings of $G$ when $k>(m-1)/\l…