【作者】 徐敏；

【导师】 刘一平； 周兴和；

【作者基本信息】 南京师范大学 ， 运筹学与控制论， 2002， 硕士

【摘要】 本文主要讨论图的有关Hamilton性问题。着重利用插点方法及图的部分平方图的独立集的邻域交与LTW-序列得到了图的s-可迹的一个新的充分条件；另外利用插点方法还得到了关于图的Hamilton性及几乎Hamilton性的四个新的充分条件。并且文中关于图的Hamilton的结果改进并推广了Ore定理。更多还原

【Abstract】 In this thesis, the author presented a new sufficient condition on s-traceability of graphs concerning the neighborhood intersections of the independent sets in partially square graphs. This sufficient condition was deduced by employing the technique of vertex insertion and the conception of LTW-sequence. Furthermore, four new sufficient conditions on hamiltonian and almost-hamiltonian graphs also were proved with the vertex insertion technique. The result generalizes Ore’s theorem.更多还原