| 2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED) |
| |
| 作者姓名： | 朱永津 |
| |
| 作者单位： | (1)中国科学院系统科学研究所,北京;(2);中国科学院系统科学研究所,北京；（3）清华大学 |
| |
| 摘 要： | 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~*)≤(?)
|
2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED) |
| |
| ZHU YONG-JIN,LIU ZHEN-HONG,YU ZHENG-GUANG.2-CONNECTED k-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN (CONTINUED)[J].Journal of Systems Science and Mathematical Sciences,1986,6(2):136-145. |
| |
| Authors: | ZHU YONG-JIN LIU ZHEN-HONG YU ZHENG-GUANG |
| |
| Institution: | (1)Institute of Systems Science,Academia Sinica;(2)Institute of Systems Science,Academia Sinica;(3)Department of Applied Mathematics,Qinghua University |
| |
| Abstract: | |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
|
