%0 Journal Article
%T A New Sufficient Condition For Hamiltonian Graphs<br>Hamilton图的一个新的充分条件
%A Dong Qi HE
%A <br>贺东奇
%J 系统科学与数学
%D 2000
%I 
%X in this paper the following result is proved: If G is a 3-connected tough graph on n vertices with vertex connectivity K such that d(x) d(y) d(z) d(w) K for any independent set {x, y, x, w} of vertices x, y, z, w, then G is hamiltonian.
%K Tough graph
%K connectivity
%K circumference
%K Hamilton cycle<br>坚韧图
%K 连通度
%K 周长
%K Hamilton
%K 圈.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=95E32A8E93295F6E&yid=9806D0D4EAA9BED3&vid=A04140E723CB732E&iid=CA4FD0336C81A37A&sid=160587E770D850AC&eid=A0FAFCE2948F1545&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=4