|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Decomposition of Complete Graphs into Isomorphic Subgraphs with Five Vertices显示文摘 | Bermond J C Huang C Rosa A and Sotteau D | 1980 | Ars Combinatoria1980，10，： | 1 |
| 2 | Decompositions of Km,n (K*m,n) into Cycles (Circuits) of Length 2k显示文摘 | SOTTEAU D | 1981 | J Combin Theory Ser B1981，30，1： | 1 |
| 3 | Decomposition of Km,n(Km,n^*) into cycles (circuits) of length 2k显示文摘 | Sotteau D | 1981 | Combinatorial Theory (Series B)1981，30，： | 1 |
| 4 | Balanced cycle and circuit designs: even cases显示文摘 | Bermond J C Huang C Sotteau D | 1978 | Ars Combin1978，5，： | 1 |
| 5 | Decomposition of Km,n(K*m,n)into cycles(circuits)of length 2k显示文摘 | Sotteau D | 1981 | J Combinatorial Theory (Series B)1981，30，： | 1 |
| 6 | Decomposition of Km,n (Km,n) into cycles(circuits) of length 2 k显示文摘 | | 1981 | Combinatorial Theory (Series B)1981，30，： | 1 |
| 7 | On the edgeforwarding index problem for small graphs 显示文摘 | Bouabdallah A Sotteau D | 1993 | Networks1993，23，4： | 1 |
| 8 | Balanced cycle and circuit designs : odd cases 显示文摘 | Bermond J C Sotteau D | 1978 | Proc Colloq Oberhof Ilmenau1978，，1： | 1 |
| 9 | Balanced cycle and circuit designs : even cases 显示文摘 | Bermond J C Huang C Sotteau D | 1978 | Ars Combin1978，5，： | 1 |
| 10 | On forwarding indices of networks显示文摘 | Heydemann M Meyer J C Sotteau D | 1989 | Discrete Applied Mathematics1989，23，2： | 1 |
| 11 | Almost resolvable decompositions of Kn显示文摘 | BennettFE Sotteau D | 1981 | J Combin Theory B1981，，2： | 1 |
| 12 | Balanced cycle and circuit designs: Even cases显示文摘 | Bermond J C Huang C Sotteau D | 1978 | Ars Combinatorial1978，，5： | 1 |
| 13 | Decompositions into cycles (circuits) of length 2k 显示文摘 | Sotteau D | 1981 | Journal of Combinatorial Theory B1981，，30： | 1 |
| 14 | Resolvable decomposition of K*n显示文摘 | Bermond J C Germa A Sotteau D | 1979 | J Combin Theory1979，26，： | 1 |
| 15 | Almost resolvable decomposition of K*n显示文摘 | Bennett F E Sotteau D | 1981 | J Combin Theory1981，30，： | 1 |
| 16 | Decomposition of Km,n(K*m,n) into Cycles (Circuits) of Length 2k显示文摘 | | 1981 | Combinatorial Theory1981，30，： | 1 |
| 17 | Resolvable decomposition of K*n显示文摘 | Bermond J C Germa A Sotteau D | | 0，，： | 1 |
| 18 | Decomposition of Complete Graphs into Isomorphic Subgraphs with Five Vertices显示文摘 | Bermond J C Huang C Rosa A and Sotteau D | 1980 | Ars Combinatoria1980，10，： | 1 |
| 19 | Decomposition of complete graphs into isomorphic subgraphs with five vertices显示文摘 | Bermond J C Huang C Rosa A and Sotteau D | 1980 | Ars Combinatoria1980，10，： | 1 |
| 20 | Decomposition of Km,n (Km,n) into cycles(circuits) of length 2k 显示文摘 | Sotteau D | 1981 | Combinatorial Theory (B)1981，30，： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员