A product theorem for row-complete Latin squares

In this article it is shown how to construct a row-complete latin square of order mn, given one of order m and given a sequencing of a group of ordern. This yields infinitely many new orders for which row-complete latin squares can be constructed. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 311–318, 1997