On Spanning Trees without Vertices of Degree 2 in Plane Triangulations

Let G be a 2-connected plane graph such that at most one of its faces is not a triangle. It is proved that G has a spanning tree without vertices of degree 2. Bibliography: 3 titles.