  The 3-Decomposition Conjecture states that every connected cubic graph can be
decomposed into a spanning tree, a 2-regular subgraph and a matching. We show
that this conjecture holds for the class of connected plane cubic graphs.
