1. Bondy, J.A., Murty, U.S.: Graph Theory with Applications. Macmillan, London (1976)
2. Borodin, O.V., Ivanova, A.O.: Planar graphs without triangular $$4$$-cycles are 4-choosable. Sib. Electron. Math. Rep. 5, 75–79 (2008)
3. Cheng, P., Chen, M., Wang, Y.: Planar graphs without 4-cycles adjacent to triangles are 4-choosable. Discrete Math. 339(12), 3052–3057 (2016)
4. Choi, L., Clemen, F.C., Ferrara, M., Horn, P., Ma, F., Masařík, T.: Flexibility of planar graphs-sharpening the tools to get lists of size four (2020). arXiv:2004.10917
5. Dvořák, Z., Masařík, T., Musílek, J., Pangrác, O.: Flexibility of triangle-free planar graphs. J. Graph Theory (2020). https://doi.org/10.1002/jgt.22634