1. A. Bassa, J. Burns, J. Campbell, A. Deshpande, J. Farley, M. Halsey, S. Michalakis, P.-O. Persson, P. Pylyavskyy, L. Rademacher, A. Riehl, M. Rios, J. Samuel, B. Tenner, A. Vijayasaraty, L. Zhao, D.J. Kleitman, Partitioning a Planar Graph of Girth Ten Into a Forest and a Matching, 2004 (manuscript)
2. Covering planar graphs with forests;Balogh;J. Combin. Theory B,2005
3. D. Gonçalves, Covering planar graphs with degree bounded forests, J. Combin. Theory B (submitted for publication)
4. Edge-partitions of planar graphs and their game coloring numbers;He;J. Graph Theory,2002
5. D.J. Kleitman, Partitioning the Edges of a Girth 6 Planar Graph into those of a Forest and those of a Set of Disjoint Paths and Cycles (manuscript)