The Hamilton-Connectivity with the Sum Degree of Subgraph in Claw-Free Graphs
Jing Mi, Wang Jiang-lu · 2014
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, ( ) 3 G δ ≥ . If H1 and H2, any two non-adjacent subgraphs, are isomorphic to P3 and K2, respectively, and d(H1) + d(H2) ≥ n, for each pair of u,v ∈ G, when {u,v} isn't a cut set, there exists a Hamilton-path in u,v.