DECOMPOSITION OF THE COMPLETE R-GRAPH INTO COMPLETE R-PARTITE R-GRAPHS

被引：16

作者：

ALON, N

机构：

[1] TEL AVIV UNIV,DEPT MATH,IL-69978 TEL AVIV,ISRAEL

[2] MIT,DEPT MATH,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1007/BF01788083

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：95 / 100

页数：6

共 7 条

[1]

Aharoni R., COMMUNICATION

[2] DISTANCE MATRIX POLYNOMIALS OF TREES [J].

GRAHAM, RL ;

LOVASZ, L .

[3] ADDRESSING PROBLEM FOR LOOP SWITCHING [J].

GRAHAM, RL ;

POLLAK, HO .

BELL SYSTEM TECHNICAL JOURNAL, 1971, 50 (08) :2495-+

[4]

GRAHAM RL, 1973, LECTURE NOTES MATH, V303, P99

[5]

Lovasz L, 1979, COMBINATORIAL PROBLE, P73

[6] A NEW PROOF OF A THEOREM OF GRAHAM AND POLLAK [J].

PECK, GW .

[7] ON THE DECOMPOSITION OF KN INTO COMPLETE BIPARTITE GRAPHS [J].

TVERBERG, H .