1. Diagonal 11-coloring of plane triangulation;Borodin;J. Graph Theory,1990
2. Planar graphs without triangular 4-cycles are 4-choosable;Borodin;Sib. Èektron. Mat. Izv.,2008
3. On a special face colouring of cubic graphs;Bouchet;Ars Combin.,1987
4. Choosability in graphs;Erdős;Congress. Numer.,1980
5. Planar graphs without 7-cycles are 4-choosable;Farzad;SIAM J. Discret. Math.,2009