Publication date
October 1995
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractThe n × n matrix over Z with (i,j) entry 12[i(i − 1) + j(j − 1)] is a complete latin square if and only if n is a power of 2
AbstractThe n × n matrix over Z with (i,j) entry 12[i(i − 1) + j(j − 1)] is a complete latin square if and only if n is a power of 2
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
AbstractThe classical definition of Latin squares is generalized by allowing multiple occurences of ...
AbstractIn 1983, necessary and sufficient conditions were obtained for an incomplete idempotent lati...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
AbstractLet A be a Latin square of order n. Then the jth right diagonal of A is the set of n cells o...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractThis paper is a continuation of a study on a new class of combinatorial structures called ge...
A diagonal Latin square of order n can be embedded in a diagonal Latin square of order t if and only...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractIn a recent book, Dénes and Keedwell pose several questions concerning row-complete latin sq...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
AbstractLet A be a Latin square of order n. Then the jth right diagonal of A is the set of n cells o...
AbstractA multi-latin square of order n and index k is an n×n array of multisets, each of cardinalit...
The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remain...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
AbstractThe classical definition of Latin squares is generalized by allowing multiple occurences of ...
AbstractIn 1983, necessary and sufficient conditions were obtained for an incomplete idempotent lati...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
AbstractLet A be a Latin square of order n. Then the jth right diagonal of A is the set of n cells o...
AbstractA latin square is said to be an N2-latin square (see[1] and [2]) if it contains no latin sub...
AbstractThis paper is a continuation of a study on a new class of combinatorial structures called ge...
A diagonal Latin square of order n can be embedded in a diagonal Latin square of order t if and only...
AbstractThe i th power, Li, of a Latin square L is that matrix obtained by replacing each row permut...
AbstractIn a recent book, Dénes and Keedwell pose several questions concerning row-complete latin sq...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
AbstractLet A be a Latin square of order n. Then the jth right diagonal of A is the set of n cells o...
AbstractA multi-latin square of order n and index k is an n×n array of multisets, each of cardinalit...
The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remain...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
AbstractThe classical definition of Latin squares is generalized by allowing multiple occurences of ...
AbstractIn 1983, necessary and sufficient conditions were obtained for an incomplete idempotent lati...
Add to ORKG