Hamilton图的一个新的充分条件

A NEW SUFFICIENT CONDITION FOR HAMILTONIAN GRAPHS

设Ｇ是一个ｎ阶３－连通１－坚韧图，以（Ｇ）表示Ｇ的四元独立点集的次和的最小值，（Ｇ）为Ｇ的连通度，证明若（Ｇ）（Ｇ），则Ｇ是Ｈａｍｉｌｔｏｎ图．

in this paper the following result is proved: If G is a 3-connected tough graph on n vertices with vertex connectivity K such that d(x) + d(y) + d(z) + d(w) K for any independent set {x, y, x, w} of vertices x, y, z, w, then G is hamiltonian.