Partitioning a Planar Graph of Girth 10 into a Forest and a Matching

We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated.