摘要
证明了若 G是 3连通无爪图 ,且 G的每个同构于 A的导出子图都满足 ( a1,a2 ) ,则 G是泛连通图 (除了 u,v∈ V( G) ,d( u,v) =1时 ,G中可能不存在 ( u,v)—k路外 )。由此立得C.Thomassen猜想 :每个 4连通线图均是
This paper proves that if ' G ' is a 3 connected {K 1,3 } free grah and each induced subgraph A of 'G ' satisfies ( a 1,a 2 ),then G is a panto connected graph(Except for some u and v with d (u,v )=1 there may not be any (u,v )- k path ).Then C.Thomassen's conjecture :every 4 connected line graph is Hamilton graph.
出处
《淮南工业学院学报》
2002年第2期63-65,共3页
Journal of Huainan Institute of Technology(Natural Science)