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. O.V. Borodin, A.V. Kostochka, N.N. Sheikh, Gexin Yu, Decomposing a planar graph with girth nine into a forest and a matching, European J. Combin. (in press)
3. Edge-partitions of planar graphs and their game coloring numbers;He;J. Graph Theory,2002