journal6 ›› 2008, Vol. 29 ›› Issue (1): 10-12.

• Mathematics • Previous Articles     Next Articles

Hamiltonian in k-Factor in Graph


  1. (Dept. of Math.,Zaozhuang College,Zaozhuang 277160,Shandong China)
  • Online:2008-01-25 Published:2012-05-26
  • About author:WANG Bing(1971-),female,was born in Wuhu City,Anhui Province,associate professor of Zaozhuang College,master;research area is theory of graph.
  • Supported by:

    National Natural Science Foundation of China (10471078)

Abstract: 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 Hamiltonian.

Key words: connected graph, k-factor, Hamiltonian

WeChat e-book chaoxing Mobile QQ