AbstractWe show that any partial 3 r× 3 r Latin square whose filled cells lie in two disjoint r×r sub-squares can be completed. We do this by proving the more general result that any partial 3 r by 3 r Latin square, with filled cells in the top left 2r× 2 r square, for which there is a pairing of the columns so that in each row there is a filled cell in at most one of each matched pair of columns, can be completed if and only if there is some way to fill the cells of the top left 2 r× 2 r square
We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and sh...
We study the completion problem for simple k-Latin rectangles, which are a special case of the gener...
The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remain...
AbstractWe show that any partial 3 r× 3 r Latin square whose filled cells lie in two disjoint r×r su...
Let r,c,s ∈{1,2,…,n} and let PP be a partial latin square of order n in which each nonempty cell lie...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
AbstractIn 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In ...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractCompleting partial Latin squares is shown to be NP-complete. Classical embedding techniques ...
AbstractIn this paper, we combine the notions of completing and avoiding partial latin squares. Let ...
AbstractThis paper deals with completion of partial latin squares L=(lij) of order n with k cyclical...
We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and sh...
We study the completion problem for simple k-Latin rectangles, which are a special case of the gener...
The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remain...
AbstractWe show that any partial 3 r× 3 r Latin square whose filled cells lie in two disjoint r×r su...
Let r,c,s ∈{1,2,…,n} and let PP be a partial latin square of order n in which each nonempty cell lie...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
AbstractIn 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In ...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractCompleting partial Latin squares is shown to be NP-complete. Classical embedding techniques ...
AbstractIn this paper, we combine the notions of completing and avoiding partial latin squares. Let ...
AbstractThis paper deals with completion of partial latin squares L=(lij) of order n with k cyclical...
We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and sh...
We study the completion problem for simple k-Latin rectangles, which are a special case of the gener...
The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remain...