2-CONNECTED SPANNING SUBGRAPHS OF PLANAR 3-CONNECTED GRAPHS

被引:18
|
作者
BARNETTE, DW
机构
[1] Department of Mathematics, University of California, Davis
关键词
D O I
10.1006/jctb.1994.1045
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15. We give an example of a planar 3-connected graph with no spanning 2-connected subgraph of maximum valence five. (C) 1994 Academic Press, Inc.
引用
收藏
页码:210 / 216
页数:7
相关论文
共 50 条