Completing simple partial k-Latin squares
We study the completion problem for simple k-Latin rectangles, which are a special case of the generalized latin rectangles studied for which embedding theorems are given by Andersen and Hilton (1980) in “Generalized Latin rectangles II: Embedding”, Discrete Mathematics 31(3). Here an alternative p...
Main Authors: | Nicholas Cavenagh, Giovanni Lo Faro, Antoinette Tripodi |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Peloritana dei Pericolanti
2018-11-01
|
Series: | Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali |
Online Access: |
http://dx.doi.org/10.1478/AAPP.96S2A4
|
Similar Items
-
On uniformly resolvable {K_1,2, K_1,3}-designs
by: Giovanni Lo Faro, et al.
Published: (2018-11-01) -
Uniform (<i>C</i><sub><i>k</i></sub>, <i>P</i><sub><i>k</i>+1</sub>)-Factorizations of <i>K</i><sub><i>n</i></sub> − <i>I</i> When <i>k</i> Is Even
by: Giovanni Lo Faro, et al.
Published: (2022-03-01) -
Uniformly Resolvable Decompositions of <i>K<sub>v</sub></i>-<i>I</i> into <i>n</i>-Cycles and <i>n</i>-Stars, for Even <i>n</i>
by: Giovanni Lo Faro, et al.
Published: (2020-10-01) -
Uniform {<i>C</i><sub>h</sub>,<i>S</i>(<i>C</i><sub>h</sub>)}-Factorizations of <i>K</i><sub>n</sub>−<i>I</i> for Even <i>h</i>
by: Giovanni Lo Faro, et al.
Published: (2023-08-01) -
Constructions for large sets of disjoint compatible packings on 6<i>k</i>+5 points
by: Jianguo Lei, et al.
Published: (2010-09-01)