AbstractThis paper deals with completion of partial latin squares L=(lij) of order n with k cyclically generated diagonals (li+t,j+t=lij+t if lij is not empty; with calculations modulo n). There is special emphasis on cyclic completion. Here, we present results for k=2,…,7 and odd n⩽21, and we describe the computational method used (hill climbing). Noncyclic completion is investigated in the cases k=2,3 or 4 and n⩽21
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a p...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractThis paper deals with completion of partial latin squares L=(lij) of order n with k cyclical...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractThree classes of necessary conditions for completing partial latin squares are studied. Thes...
We study the completion problem for simple k-Latin rectangles, which are a special case of the gener...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a p...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractThis paper deals with completion of partial latin squares L=(lij) of order n with k cyclical...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
AbstractWe call a latin square A=(aij) of order n, aij∈{1,2,…,n}, right-diagonal-complete if {(aij,a...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractThree classes of necessary conditions for completing partial latin squares are studied. Thes...
We study the completion problem for simple k-Latin rectangles, which are a special case of the gener...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a p...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
DOI
Add to ORKG