无爪图的次与Hamilton连通性

Degree and Hamiltonian-connectivity in Claw-free Graph

本文证明了：设G是n阶、k（≥3）连通无爪图，且不含同构于B的导出子图，若存在点v_0∈V（G），使d（v_0）≥n-2k＋4，则G是Hamilton连通的．

It is proved that G is a｛K_(1、3，B｝-free,k（≥3）-connected graph of order n such that d（v_0）≥n-2k＋4 for a vertex v_0 in G,then G is hamiltonican-connected．