List coloring $C_3$-free planar graphs with a sparse matching of restricted lists

Stephen G. Hartke, Yupei Li, Joseph Pappe +3

A graph $G$ is $k$-choosable if it has a proper coloring for every $k$-list assignment. While every $C_3$-free planar graph is $4$-choosable, some of them are not $3$-choosable, as…