I feel sure this must be known, but can I find it??

Which connected plane graphs (graphs drawn in the plane without crossings) have a spanning tree such that at least one edge of each face is in the tree?

If multiple edges are allowed, there might be simply too many faces, and other obstructions are easy to find. But I don't know about simple graphs.