2-connected spanning subgraphs of planar 3-connected graphs (Q1333340)

In 1966, the author proved that every 3-connected planar graph has a spanning subgraph that is a tree of maximum valency 3; see [Can. J. Math. 18, 731-736 (1966; Zbl 0141.214)]. The present paper contains a proof that in every 3-connected planar graph there is a 2-connected spanning subgraph of maximum valency 15. An example is given of a 3-connected planar graph with no 2-connected spanning subgraph of maximum valency 5.