  We show that the vertices of every planar graph can be partitioned into two
sets, each inducing a so-called triangle-forest, i.e., a graph with no cycles
of length more than three. We further discuss extensions to locally planar
graphs.
