k-因子的哈密顿性质(英文)

Hamiltonian in k-Factor in Graph

借助Bauer定理给出了一个猜想的简短证明:如果图G含有k-因子且是2-连通的,并满足σ2(G)≥n-k,那么图G是哈密顿的.

Through Bauer Theorem, the author gives 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 Hamihonian.