| 6连通图中的可收缩边 |
| |
| 引用本文： | 袁旭东,苏健基. 6连通图中的可收缩边[J]. 数学进展, 2004, 33(4): 441-446 |
| |
| 作者姓名： | 袁旭东 苏健基 |
| |
| 作者单位： | 广西师范大学数学系,桂林,广西,541004 |
| |
| 基金项目： | The work partially supported by NNSF of China(No.10171022) |
| |
| 摘 要： | Kriesell(2001年)猜想：如果κ连通图中任意两个相邻顶点的度的和至少是2[5κ/4]-1则图中有κ-可收缩边．本文证明每一个收缩临界6连通图中有两个相邻的度为6的顶点，由此推出该猜想对κ=6成立。
|
| 关 键 词： | 连通图 收缩临界连通 可收缩边 分离集 断片 |
Contractible Edges in 6 Connected Graphs |
| |
| Abstract. Contractible Edges in 6 Connected Graphs[J]. Advances in Mathematics(China), 2004, 33(4): 441-446 |
| |
| Authors: | Abstract |
| |
| Abstract: | Kriesell conjectured that every K, connected graph has a k-contractible edge if the degree sum of any two adjacent vertices is at least 2 5k/4- 1. In this note, we proved that every contraction-critical 6 connected graph contains two adjacent vertices of degree 6, so this conjecture is true for K = 6. |
| |
| Keywords: | connected graph contraction-critical connected contractible edge separating set fragment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
