Completing partial Latin squares with two filled rows and two filled columns.
Adams, Peter, Bryant, Darryn, Buchanan, Melinda (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Latin squares with forbidden entries.”
Completing partial Latin squares with two filled rows and two filled columns.
When is an Incomplete 3 × n Latin Rectangle Completable?
Reinhardt Euler, Paweł Oleksik (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We use the concept of an availability matrix, introduced in Euler [7], to describe the family of all minimal incomplete 3 × n latin rectangles that are not completable. We also present a complete description of minimal incomplete such latin squares of order 4.
The complexity of constructing gerechte designs.
Vaughan, E.R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the completion of incomplete latin squares.
R. Dacic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Matchings and partial patterns.
Jelínek, Vít, Mansour, Toufik (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A class of latin squares derived from finite abelian groups
Anthony B. Evans (2014)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We consider two classes of latin squares that are prolongations of Cayley tables of finite abelian groups. We will show that all squares in the first of these classes are confirmed bachelor squares, squares that have no orthogonal mate and contain at least one cell though which no transversal passes, while none of the squares in the second class can be included in any set of three mutually orthogonal latin squares.
Latin -parallelepipeds not completing to a Latin cube
Martin Kochol (1989)
Mathematica Slovaca
Similarity:
A generalization of transversals for Latin squares.
Wanless, Ian M. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decomposing complete tripartite graphs into closed trails of arbitrary lengths
Elizabeth J. Billington, Nicholas J. Cavenagh (2007)
Czechoslovak Mathematical Journal
Similarity:
The complete tripartite graph has edges. For any collection of positive integers with and for , we exhibit an edge-disjoint decomposition of into closed trails (circuits) of lengths .