Hamiltonicity of 4-connected Graphs  

作　　者：Hao LI Feng TIAN Zhi Xia XU 

机构地区：[1]LRI, Univ. Paris-sud 11 and CNRS, Orsay F-91405, France [2]School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, P. R. China [3]Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, P. R. China [4]Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin 300071, P. R. China [5]Department of Mathematics, Tianjin Polytechnic University, Tianjin 300160, P. R. China

出　　处：《Acta Mathematica Sinica,English Series》2010年第4期699-710,共12页数学学报（英文版）

基　　金：Supported by NNSF of China (Grant No. 60373012);supported by NSFC (Grant No. 10601044);XJEDU2006S05

摘　　要：Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of order n and σ5（G） 〉 n ＋ 3σ（G） ＋ 11, then G is Hamiltonian.Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of order n and σ5（G） 〉 n ＋ 3σ（G） ＋ 11, then G is Hamiltonian.

关 键 词：k-connected HAMILTONIAN insertible vertex crossing diagonals 

分 类 号：O157.5[理学—数学] O11[理学—基础数学]