Choice number of complete multipartite graphs $K_{3\ast 3,2\ast (k-5),1\ast 2}$ and $K_{4,3\ast 2,2\ast (k-6),1\ast 3}$

Wenjie He, Lingmin Zhang, Daniel W. Cranston +2

A graph $G$ is called \emph{chromatic-choosable} if its choice number is equal to its chromatic number, namely $Ch(G)=\chi (G)$. Ohba has conjectured that every graph $G$ satisfying $|…