k-连通图的可收缩边(英文)  

Contractible Edges of k-connected Graphs

作　　者：覃城阜[1] 谭丽[1] 

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

出　　处：《广西科学》2010年第4期287-291,共5页Guangxi Sciences

基　　金：supported by Guangxi Natural Science Foundation(No:0991101)

摘　　要：证明了对k-连通图G,若G的任意一个断片满足当N(F)中含有边就有|F|>k/4,则G至少有2条可收缩边.This paper show that a k - connected graph G has at least two contractible edges if any fragment which neighborhood contains an edge has cardinality exceeding k/4.

关 键 词：K-连通图 可收缩边 断片 

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