AbstractIn 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In this paper, we tighten the Colbourn result by showing that completing a partially filled square remains hard even if no more than three unfilled cells exist in any row or column of the square and where only three integers are available
AbstractThree classes of necessary conditions for completing partial latin squares are studied. Thes...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractIn 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In ...
AbstractCompleting partial Latin squares is shown to be NP-complete. Classical embedding techniques ...
A classical question in combinatorics is the following: given a partial Latin square $P$, when can w...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractWe show that any partial 3 r× 3 r Latin square whose filled cells lie in two disjoint r×r su...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
Let r,c,s ∈{1,2,…,n} and let PP be a partial latin square of order n in which each nonempty cell lie...
AbstractIn this paper, we combine the notions of completing and avoiding partial latin squares. Let ...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
AbstractWe introduce the notion of an availability matrix and apply a theorem of Frobenius–König to ...
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a p...
AbstractThree classes of necessary conditions for completing partial latin squares are studied. Thes...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
AbstractIn 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In ...
AbstractCompleting partial Latin squares is shown to be NP-complete. Classical embedding techniques ...
A classical question in combinatorics is the following: given a partial Latin square $P$, when can w...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
AbstractWe show that any partial 3 r× 3 r Latin square whose filled cells lie in two disjoint r×r su...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
Let r,c,s ∈{1,2,…,n} and let PP be a partial latin square of order n in which each nonempty cell lie...
AbstractIn this paper, we combine the notions of completing and avoiding partial latin squares. Let ...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
AbstractWe introduce the notion of an availability matrix and apply a theorem of Frobenius–König to ...
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a p...
AbstractThree classes of necessary conditions for completing partial latin squares are studied. Thes...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
The set PLS(a, b; n) is the set of all partial latin squares of order n with a completed rows, b com...
DOI
Add to ORKG