ε≥〔_2^（V－1）〕的简单图的哈密顿分类

A Hamiltonian Classification of Simple Craphs with

研究了γ阶（γ，γ－ｋ）图（ｋ≥０）和Ｃγ的包装问题，对边数的简单图进行了哈密顿分类，得到了全部的非哈密顿图，由此推广了Ｏｒｅ和Ｂｏｎｄｙ关于此类问题的结果。

The problem for{G,Cγ}to be packable has been studied.where|V(G)|=|V(Cγ)=γ,G is a(γ,γ-k)graph(k≥0) and Cγ is a Hamiltonian cycle. A Hamiltonian classlfication of simplegraphs with is given and all of nonHamiltonian graphs are thus obtained. It furtherextends the result that Ore a nd Bondy had got.