强4-连通图的可收缩边  

Retractable Edges of Strong 4-connected Graphs

作　　者：董宁 莫芬梅 陈碧楠 

机构地区：[1]广西师范学院数学与统计科学学院,广西南宁530023

出　　处：《广西师范学院学报（自然科学版）》2017年第4期30-35,共6页Journal of Guangxi Teachers Education University(Natural Science Edition)

基　　金：国家自然科学基金(11401119)

摘　　要：该文主要研究强4—连通图G上的可去边的数目,证明了强4-连通图G的任何一个生成树T上至少有3条可收缩边.进一步证明了除了一个特殊图外强4-连通的任意最长圈C上至少有5条可收缩边.有例子表明该文的结果是最好可能的.1n this paper,we study the strong 4-connected graph to go on the side. The number proved that on strong 4-connected graph any of the spanning tree has at least 3 retractable edges. 1t is further proved that in addition to an exceptional figure every longest circle of a 4-connecting has at least 5 retractable edges. Examples show that ours is the best possible.

关 键 词：强4-连通图 生成树 最长圈 可收缩边 

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