Cones of Theta Graphs are Enumeratively Chromatic-Choosable

Kingston Barnes, Vincent Fesenmeier, Braxton Gaither +7

Chromatic choosability is a fundamental notion in list coloring. A graph $G$ is chromatic-choosable if its chromatic number $\chi (G)$ equals its list chromatic number ${\chi }_{\ell }(G)$. I…