我们给出一个猜想的简短证明:如果2-连通的图G含有k-因子,且满足σ2(G)≥n-k,图G是Hamihonian的.
We give a new short proof of a conjecture : Let G be a 2-connected graph on n vertices where every pair of nonadjacent vertices has degree sum at least n - k and assume furthermore that G has a k-factor,then G is Hamiltonian.