The intricacy of avoiding arrays is 2

DOI10.1016/J.DISC.2005.11.009zbMath1086.05018OpenAlexW1976251484MaRDI QIDQ2368927

Lars-Daniel Öhman

Publication date: 28 April 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.009

zbMATH Keywords

Latin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (1)

On the intricacy of avoiding multiple-entry arrays

Cites Work

• On the intricacy of combinatorial construction problems
• Avoiding partial Latin squares and intricacy

This page was built for publication: The intricacy of avoiding arrays is 2