关于非Hamilton图的一点注记

A Note on None-Hamiltonian Graphs

设Ｇ是一个ｋ－连通非Ｈａｍｉｌｔｏｎ图．Ｃ是最长圈，Ｈ是Ｇ＼Ｃ的分支。记ｙｉ∈ＮＣ＋（Ｈ），１≤ｉ≤ｋ。有．由它可推出一组大次和充分条件。

Let G be a k-connected none-Hamiltonian graph with n venices and C be a longest cycle of G. If H is a component of G\C with y1, y2…,yk∈N(H),then for exch 1≤i≤k,As a consequence of this result, we get a sufficien condition for Hamiltonian graphs.