Preprint
Jul 2026
The unlabeled list color function of disconnected graphs
Given a graph $G$, its chromatic polynomial $P (G, k)$ counts proper $k$-colorings, while the corresponding list color function $P_{\ell} (G, k)$ counts the minimum number of proper colorings across all assignments of $k$ colors to each vertex. While it is clear that $P_{\ell} (G, k) \leq P (G, k)$, Donner showed in 19...
Hemanshu Kaul, Jeffrey A. Mudrock, Armin Straub
· 0 citations