ON COVERING AND COLORING PROBLEMS FOR ROOK DOMAINS

被引:17
作者
CARNIELLI, WA [1 ]
机构
[1] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720
关键词
D O I
10.1016/0012-365X(85)90152-9
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:9 / 16
页数:8
相关论文
共 9 条
[1]   ROOK DOMAINS LATIN SQUARES AFFINE PLANES + ERROR-DISTRIBUTING CODES [J].
GOLOMB, SW ;
POSNER, EC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (03) :196-&
[2]  
KAMPS HJL, 1967, J COMB THEORY, V3, P315
[3]  
KAMPS HJL, 1969, C MATH SOC JANOS BOL, P679
[4]  
RODEMICH ER, 1970, J COMB THEORY, V9, P117
[5]   MAXIMUM DISTANCE Q-NARY CODES [J].
SINGLETON, RC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (02) :116-&
[6]   INTERSECTION INEQUALITIES FOR COVERING PROBLEM [J].
STANTON, RG ;
KALBFLEI.JG .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (06) :1311-&
[7]  
STANTON RG, 1969, J LOND MATH SOC, V2, P493
[8]  
STANTON RG, 1968, AEQUATIONES MATH, V1, P94
[9]  
ZAREMBA SK, 1952, J LOND MATH SOC, V27, P242