4连通图中最长圈上的可去边  

Removable Edges in the Longest Cycles of a 4-connected Graph

作　　者：徐丽琼[1] 

机构地区：[1]集美大学理学院,福建厦门361021

出　　处：《厦门大学学报（自然科学版）》2016年第4期550-553,共4页Journal of Xiamen University：Natural Science

基　　金：国家自然科学基金(11301217);福建省自然科学基金(2013J01014);福建省高等学校新世纪优秀人才(JA14168)

摘　　要：图的可收缩边与可去边是研究连通图的构造和使用归纳法证明连通图的一些性质的有力工具.利用边点割断片的性质给出了某类4连通图中在特定子图上可去边的分布情况,证明了若4连通图G的边点割原子的顶点数大于2,则G中的最长圈C上至少有3条可去边.Contractible edges and removable edges in connected graphs are a powerful tool to study the structures of graphs and to prove some properties of connected graphs by induction.In this paper by ananlyzing the properties of edge-vertex cut fragment we show that if an edge-vertex-atom of a 4-connected graph G contains at least three vertices,then there are at least three removable ed-ges in a longest cycle of G.

关 键 词：4连通图 可去边 边点割原子 

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