LEGAL COLORING OF GRAPHS

被引：21

作者：

LINIAL, N ^{[1
]}

机构：

[1] HEBREW UNIV JERUSALEM,INST MATH & COMP SCI,IL-91904 JERUSALEM,ISRAEL

来源：

关键词：

D O I：

10.1007/BF02579408

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：49 / 54

页数：6

共 10 条

[1] COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVES [J].

DOBKIN, DP ;

LIPTON, RJ .

[2] INFORMATION BOUNDS ARE WEAK IN THE SHORTEST DISTANCE PROBLEM [J].

GRAHAM, RL ;

YAO, AC ;

YAO, FF .

[3]

Greene C., 1977, HIGHER COMBINATORICS, P65

[4]

Grunbaum B, 1967, CONVEX POLYTOPES

[5]

MANBER U, 1981, 22ND P ANN S F COMP

[6]

RIVEST R, 1980, SIAM J COMPUT, V9, P343

[7]

SNIR M, 1981, LNCS, V115, P305

[8]

Stanley R. P., 1973, Discrete Mathematics, V5, P171, DOI 10.1016/0012-365X(73)90108-8

[9]

ZASLAVSKY T, 1975, MEM AMS, V154

[10]

ZASLAVSKY T, 1981, AM MATH MONTHLY, P88