广西师范大学学报（自然科学版）2001，Vol.19Issue(1)：25-29,5.
3连通图的可去边的分布
DISTRIBUTION OF REMOVABLE EDGES IN 3-CONNECTED GRAPHS
摘要
Abstract
An edge e of a 3-connected graph G is said to be removable if G-eis the subdivition of a 3-connected graph.The distribu tion of removable edges in 3-connected graphs is discussed in the paper.The following results are obtained:(1) Let C be a cycle in 3-connected graph G with υ(G)≥6.If this cycle contains no three consecutive vertices wit h degree three,then there are at least two removable edges in it.(2) Let T b e a spanning tree of G with υ(G)≥5.If G contains at most one maxim al semiwheel,then T has at least one removable edge,and thus there is at lea st one removable edge in the spanning tree of 3-connected cubic graphs with ord er at least five.关键词
3连通图/可去边的分布/圈/生成树分类
数理科学引用本文复制引用
欧见平,苏健基..3连通图的可去边的分布[J].广西师范大学学报（自然科学版）,2001,19(1):25-29,5.基金项目
国家自然科学基金资助课题(19561001) （19561001）
