摘要: 本文定义了子图的度的概念，并利用子图的度给出如下结果：设 G是n阶2-连通无爪图，δ(G)≥3，如果G中任意两个分别同构于P₃和K₂的不相邻子图H₁，H₂的度和，对于任意的u,vÎG，若{u,v}不构成割集，那么u,v间存在Hamilton路。

Abstract: In this paper , we defined the degree of subgraph, and got the following result on the basis of the degree of subgraph: Let G be a 2-connected claw-free graph of order n , . If H ₁ and H ₂ , any two non - adjacent subgraphs , are isomorphic to P ₃ and K ₂ , respectively , and d ( H ₁ ) + d ( H ₂ ) ≥ n , for each pair of u , v Î G , when { u , v } isn ’ t a cut set, there exis ts a Hamilton-path in u , v .