EDGE-PACKINGS OF GRAPHS AND NETWORK RELIABILITY

被引：28

作者：

COLBOURN, CJ

机构：

来源：

关键词：

D O I：

10.1016/0012-365X(88)90193-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：49 / 61

页数：13

共 24 条

[11]

Garey MR., 1979, COMPUTERS INTRACTABI

[12] THE NP-COMPLETENESS OF EDGE-COLORING [J].

HOLYER, I .

[13] NP COMPLETENESS OF FINDING THE CHROMATIC INDEX OF REGULAR GRAPHS [J].

LEVEN, D ;

GALIL, Z .

[14]

Lomonosov M. V., 1972, Problems of Information Transmission, V8, P118

[15]

Lomonosov M. V., 1971, Problems of Information Transmission, V7, P337

[16]

Menger K., 1927, FUND MATH, V10, P96, DOI DOI 10.4064/FM-10-1-96-115

[17]

Nash-Williams CSJA., 1961, J LOND MATH SOC, V36, P445, DOI DOI 10.1112/JLMS/S1-36.1.445

[18]

POLESSKII VP, 1971, PROBL INFORM TRANSM, V7, P165

PROVAN, JS ;

BALL, MO .

[20]

RAMANATHAN A, 1987, ARS COMBINATORIA, V23A, P229