Hamiltonicity of k-connected Quasi-claw-free Graphs
Dong Li-hua · Science Technology and Engineering · 2007
The concept of quasi-claw-free graph is raised by Ainouche,and every claw-free graph is quasi-claw-free graph.The result is given : A k-connected quasi-claw-free graph G,(k≥2) is Hamilton if ∑v∈Xd(v)≥n-k holds for every independent set X of cardinality(k+1) in G2.