1. On acyclic colorings of planar graphs;Borodin;Discrete Math.,1979
2. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;Borodin;Diskretn. Anal. Issled. Oper.,2001
3. Sparse graphs are near-bipartite;Cranston;SIAM J. Discrete Math.,2020
4. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree;Dross;European J. Combin.,2017
5. Ein dreifarbensatz für dreikreisfreie netze auf der kugel;Grötzsch;Sci. Z. Martin Luther Univ. Halle-Wittenberg Math.-Nature. Line,1959