1. Colorings and orientations of graphs;Alon;Combinatorica,1992
2. Planar graphs are 1-relaxed, 4-choosable;Cushing;European J. Combin.,2010
3. Chip games and paintability;Duraj;Electron. J. Combin.,2016
4. Defective list colorings of planar graphs;Eaton;Bull. Inst. Combin. Appl.,1999
5. J. Grytczuk, X. Zhu, The Alon–Tarsi number of a planar graph minus a matching, arXiv:1811.12012.