HOW ROBUST IS THE N-CUBE

被引：38

作者：

BECKER, B

SIMON, HU

机构：

来源：

关键词：

D O I：

10.1016/0890-5401(88)90056-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：162 / 178

页数：17

共 12 条

[1] EVERY PLANAR MAP IS 4 COLORABLE .1. DISCHARGING [J].

APPEL, K ;

HAKEN, W .

[2]

CAI MC, 1983, DISCRETE MATH, V47, P13

[3]

CHUNG FRK, 1983, UNPUB DIAMETER BOUND

[4] A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS [J].

DILWORTH, RP .

[5]

Friedman J., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P506, DOI 10.1109/SFCS.1984.715953

[6]

HASTAD J, 1987, 19TH P ANN ACM S THE, P274

[7]

Kleitman D. J., 1973, Discrete Mathematics, V6, P255, DOI 10.1016/0012-365X(73)90098-8

[8]

PEASE MC, 1977, IEEE T COMPUT, V26, P458, DOI 10.1109/TC.1977.1674863

PREPARATA, FP ;

VUILLEMIN, J .

[10]

SCHONHEIM J, 1971, J COMB THEORY A, V11, P111