Equitable Choosability of Prism Graphs

Kirsten Hogenson, Dan Johnston, Suzanne O'Hara

A graph $G$ is equitably $k$-choosable if, for every $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil |V(G)|/k\rceil$ vert…