On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs

Kennedy Cano, Emily Gutknecht, Gautham Kappaganthula +3

We say that a graph $G$ is chromatic-choosable when its list chromatic number $\ddot{I}{‡}_{\ell }(G)$ is equal to its chromatic number $\ddot{I}‡(G)$. Chromatic-choosability is a well-studied topi…