2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED)

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~*)≤(?)