%0 Journal Article
%T 2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED)
%A ZHU YONG-JIN
%A <br>朱永津
%J 系统科学与数学
%D 1986
%I 
%X Let X~* and Y~* be generated by S(?){v_0},where G(S)is Hamiltonian connected and|X~*|=x~*,|Y~*|=Y~* and S_1~*,S_2~*,…,S_(x*)~* be the sets of vertices contained in the opensegments of C between vertices of X~*.Let S_1~*,x_1,S_2~*,x_2,…,S_(x*)~*,x_(?)~* be the segmentsand vertices of X~* in order around C.S_i~* is said to be an X~*(3)-interval if one ofx_(i-1)and x_i belongs to X_j~*—X_2~*.Let S=S_1~*,and S={a_1,c_1,c_2,…,c_1,b_1}.It is easy to see that the statement inLemma 2 can be modified as(?)({a_1,b_1},S_i~*)≤(?)
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=EFE516FCFBF40AA0C9A0D7BCD040D815&yid=4E65715CCF57055A&vid=B31275AF3241DB2D&iid=0B39A22176CE99FB&sid=58F693790F887B3B&eid=769BD58726D66E7D&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0