Complexity of Near-3-Choosability Problem

Sounaka Mishra, Rohini S, Sagar S. Sawant

It is currently an unsolved problem to determine whether a $△$-free planar graph $G$ contains an independent set $A$ such that $G[V_G\setminus A]$ is $2$-choosable. However…