Latin parallelepipeds not completing to a cube
Martin Kochol (1991)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Martin Kochol (1991)
Mathematica Slovaca
Similarity:
R. Dacic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Lefevre, James G., McCourt, Thomas A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
McKay, Brendan D., Rogoyski, Eric (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wanless, Ian M. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grannell, M.J., Griggs, T.S., Knor, M. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stones, Douglas S. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.