Eulerian Maximal Planar Graph partition into two trees

The proof of EMPG can be partition into two trees is after remove a argument cycle C with k vertices, the G-C is also Euler. Then the argument cycle can map into a vertex with k degree (k is even). therefore, G-C is a small EMPG. repeat this action, it can partition into more smaller planar graph?