Decomposition of some planar graphs into trees

Abstract

We prove that each simple planar graph G whose all faces are quadrilaterals can be decomposed into two disjoint trees Tr and Tb such that V(Tr) = V(G - u) and V(Tb) = V(G - v) for any two non-adjacent vertices u and v of G.