1 paper
Jakub Kozik, Bartosz Podkanowicz
Thomassen in 1994 published a famous proof of the fact that the choosability of a planar graph is at most 5. Zhu in 2019 generalized this result by showing that the same bound hold…