\input zb-basic
\input zb-ioport
\iteman{io-port 00896026}
\itemau{Petrovi\'c, Vojislav}
\itemti{Decomposition of some planar graphs into trees.}
\itemso{Discrete Math. 150, No.1-3, 449-451 (1996).}
\itemab
The author proves that if $G$ is a quadrangulation of the plane and $u$ and $v$ are two nonadjacent vertices of $G$, then $G$ is the union of two edge-disjoint trees such that one is a spanning tree of $G-u$ and the other is a spanning tree of $G-v$.
\itemrv{C.Thomassen (Lyngby)}
\itemcc{}
\itemut{quadrangulation; edge-disjoint tree; spanning tree}
\itemli{doi:10.1016/0012-365X(95)00214-H}
\end