We prove the conjecture made by O. V. Borodin in 1976 that the vertex
set of any planar graph can be decomposed into two sets such that one
of them induces a 3-degenerate graph and the other induces a 2-degener
ate graph, that is, a forest. (C) 1995 Academic Press, Inc.