摘要: |
证明了对k-连通图G,若G的任意一个断片满足当N(F)中含有边就有|F|>k/4,则G至少有2条可收缩边. |
关键词: k-连通图 可收缩边 断片 |
DOI: |
投稿时间:2010-03-09修订日期:2010-04-06 |
基金项目:This research was supported by Guangxi Natural Science Foundation(No:0991101). |
|
Contractible Edges of k-connected Graphs |
QIN Cheng-fu, TAN Li
|
(School of Mathematics Science, Guangxi Teachers Education University, Nanning, Guangxi, 530023, China) |
Abstract: |
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. |
Key words: k-connected graph contractible edge fragment |