2‐connected coverings of bounded degree in 3‐connected graphs
Zhicheng Gao · Journal of Graph Theory · 1995
Abstract In a recent paper, Barnette showed that every 3‐connected planar graph has a 2‐connected spanning subgraph of maximum degree at most fifteen, he also constructed a planar triangulation that does not have 2‐connected spanning subgraphs of maximum degree five. In this paper, we show that every 3‐connected graph which is embeddable in the sphere, the projective plane, the torus or the Klein bottle has a 2‐connected spanning subgraph of maximum degree at most six. © 1995 John Wiley & Sons, Inc.