收缩临界6连通图的6度顶点  

Vertices of Degree 6 for Contraction-Critical 6-Connected Graph

作　　者：卢建立[1] 张志芳[1] 

机构地区：[1]河南师范大学数学与信息科学学院,河南新乡453007

出　　处：《数学的实践与认识》2011年第13期169-173,共5页Mathematics in Practice and Theory

基　　金：河南省杰出青年计划(084100510013);河南省高校科技创新人才支持计划(2008 HASTIT023)

摘　　要：利用断片的性质,改进了齐恩凤,齐登记等的研究结果,得到了收缩临界6-连通图中6度点的性质的新结果:设x是G中任意一点,设A是一个x-原子,记N_A=T_A,N(x)∩T_A≠Φ,则A∩T_A中有与x相邻的6度点或两点的距离为2.In this paper, adopting he nature of fragments, we improved the results of Qi Enfeng and Qi Dengji, and got he following new result： let x is a arbitrary vertex and A is a x-atom in a contraction-critical 6.connected graph, bear in mind that, here exists vetex of degree 6 which adjacent with the vetex x or the distance of the two vetex is 2 in A ∩ TA

关 键 词：收缩临界6连通图 断片 最小点割 S-原子 

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