1. A proof of Grünbaum’s conjecture on the acyclic 5-colorability of planar graphs;Borodin;Dokl. Akad. Nauk SSSR.,1976
2. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;Borodin;Diskret. Anal. Issledovanie Oper.,2001
3. Defective 2-colorings of sparse graphs;Borodin;J. Combin. Theory S. B,2014
4. Threshold for path colorings of planar graphs;Chappell;Algor. Combin.,2005
5. The point-arboricity of planar graphs;Chartrand;J. Lond. Math. Soc.,1969