Enumeration of all (2k + 1;k;k 1)-NRBIBDs for 3 k 13
暂无分享,去创建一个
[1] Patric R. J. Östergård,et al. Classification of resolvablr 2-(14,7,12) and 3-(14,7,5) designs , 2003 .
[2] Carlos Velarde,et al. Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs , 2005 .
[3] B. McKay. nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .
[4] R. Jarrett. Definitions and Properties for M‐Concurrence Designs , 1983 .
[5] Patric R. J. Östergård,et al. Miscellaneous classification results for 2-designs , 2004, Discret. Math..
[6] Petteri Kaski,et al. The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments , 2005, Des. Codes Cryptogr..
[7] Carlos Velarde,et al. A complete classification of (12,4,3)‐RBIBDs , 2001 .