2-connected Coverings of Bounded Degree in 3-connected Graphs
2-connected Coverings of Bounded Degree in 3-connected Graphs
复制标题
3 连通图中有界度的 2 连通覆盖
作者：
Zhicheng Gao
在最近的一篇论文中，Barnette证明了每个3-连通平面图都有一个最大度不超过15的2-连通生成子图，他还构造了一个不具有最大度为5的2-连通生成子图的平面三角网。本文证明了任意可嵌入球面、射影平面、环面或Klein瓶中的3-连通图都有一个最大度不超过6的2-连通支撑子图。John Wiley & Sons，Inc.
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.