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

Hamiltonian in k-Factor in Graph

作　　者：王兵[1] 

机构地区：[1]枣庄学院数学系,山东枣庄277160

出　　处：《吉首大学学报（自然科学版）》2008年第1期10-12,共3页Journal of Jishou University(Natural Sciences Edition)

基　　金：National Natural Science Foundation of China (10471078)

摘　　要：借助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.

关 键 词：连通图 κ-因子 哈密顿 

分 类 号：O157[理学—数学]