2 problems

For a graph $G$, let $\chi(G)$ be its chromatic number, and let $\chi_\ell(G)$ be its list chromatic number. A graph is chromatic-choosable when $\chi_\ell(G)=\chi(G)$. Ohba's conj…

A complete $k$-partite graph is a graph whose vertices are partitioned into $k$ independent parts, with every pair of vertices in distinct parts adjacent. He et al.'s conjecture. A…