Minimal and near-minimal critical sets in back-circulant latin squares
暂无分享,去创建一个
[1] Narsingh Deo. Prüfer-Like Codes for Labeled Trees , 2001 .
[2] Francis Suraweera,et al. Two protocols for multicast communication , 2001 .
[3] Ebadollah S. Mahmoodian,et al. Critical sets in back circulant Latin rectangles , 1997, Australas. J Comb..
[4] Jennifer Seberry,et al. Latin squares and critical sets of minimal size , 1991, Australas. J Comb..
[5] Towards the Exact Value of the Ramsey Number R(3, 3, 4) , 2001 .
[6] Adelle Howse. Minimal critical sets for some small Latin squares , 1998, Australas. J Comb..
[7] S. Alsardary. An Upper Bound on the Basis Number of the Powers of the Complete Graphs , 2001 .
[8] Peter Adams,et al. Smallest critical sets for the Latin squares of orders six and seven , 2001 .
[9] Preben D. Vestergaard,et al. Dominating sets with at most k components , 2005, Ars Comb..
[10] G. H. John van Rees,et al. The Size of the Smallest Strong Critical Set in a Latin Square , 1999, Ars Comb..
[11] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.