摘要
本文证明了如果G是2-连通图且对G的任意三点独立集{u,v,w}有d(u)+d(v)+d(w)≥n+δ,则C|(G)是完全图,从而G是哈米顿的.
This paper proved that if G was a 2-connected graph such that d(u) + d(v) + d(w)≥ n + δ for every independent set {u、v、w} in G, then G was complete, therefore, G was Hamiltonian.
关键词
图论
哈米顿图
闭包
Hamiltonian graph
closure