【摘要】 对任意图G,令NC（G）=min|N（u）∪N（v）|,u与v取遍G中一切不邻接的点对.本文证明了NC（G）>（p-2）/2的不含K₃为导出子图的p阶连通图G有Hamilton链.更多还原

【Abstract】 For a graph G, 1et NC=min|N（u）∪N（v）|, where u and v are taken over all pairs of nonadjacent vertices of G. It is proved in this paper that a connected K₃ free graph of order p has a Hamiltonian path if NC>（p-2）/2.更多还原