4连通图中可去边的分布  

Removable Edges in 4-connected Graphs

作　　者：徐丽琼[1] 郭晓峰[1] 

机构地区：[1]厦门大学数学科学学院,福建厦门361005

出　　处：《厦门大学学报（自然科学版）》2005年第5期596-600,共5页Journal of Xiamen University：Natural Science

基　　金：国家自然科学基金(10331020);福建省教育厅基金(JBO1109)资助

摘　　要：图的可收缩边与可去边是研究连通图的构造和使用归纳法证明连通图的一些性质的有力工具.本文利用边点割端片的性质给出某些4连通图中在特定子图上可去边的分布情况,得到了4连通图图上存在至少两条可去边的更一般的充分条件,改进了吴吉昌等的结果.同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布.Contractible edges and removable edges in connected graphs are a powerful tool to study the structures of graphs and to prove some properties of graphs by induction. In this paper some more general sufficient conditions for any cycle C of 4-connected graphs containing at least two removable edges were given by analyzing the properties of edge-vertex cut end. So the results of Wu jichang were improved. Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.

关 键 词：4连通图 可去边 可收缩边 断片 

分 类 号：O157.5[理学—数学]