This paper proves that if $G$ is a triangle-free planar graph in which no 4-cycle is adjacent to a 4-cycle or a 5-cycle, then $G$ is on-line 3-choosable.
References
Z. Dvořr ák, B. Lidický and R. Škrekovski, 3-Choosability of triangle-free planar graphs with constraints on 4-cycles, SIAM J. Discrete Math., 24(3) (2010), 934-945. Z. Dvořr ák, B. Lidický and R. Škrekovski, 3-Choosability of triangle-free planar graphs with constraints on 4-cycles, SIAM J. Discrete Math., 24(3) (2010), 934-945.
U. Schauz, Mr. Paint and Mrs. Correct, Electron. J. Combin., Vol. 16(1), R77, 2009. 1186.05085 U. Schauz, Mr. Paint and Mrs. Correct, Electron. J. Combin., Vol. 16(1), R77, 2009. 1186.05085
Z. Tuza, Graph colorings with local constraints - A survey, Discuss. Math. Graph Theory, 17 (1997), 161-228. MR1627932 0923.05027 10.7151/dmgt.1049 Z. Tuza, Graph colorings with local constraints - A survey, Discuss. Math. Graph Theory, 17 (1997), 161-228. MR1627932 0923.05027 10.7151/dmgt.1049
