On the intricacy of avoiding multiple-entry arrays

DOI10.1016/j.disc.2012.07.003zbMath1251.05025OpenAlexW2039296700MaRDI QIDQ456895

Lars-Daniel Öhman

Publication date: 16 October 2012

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

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

zbMATH Keywords

Latin squareconstraint satisfactionlist-coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial Latin squares are avoidable
• On the intricacy of combinatorial construction problems
• A note on Latin squares with restricted support
• Avoiding partial Latin squares and intricacy
• The list chromatic index of a bipartite multigraph
• The intricacy of avoiding arrays is 2
• Latin squares with forbidden entries
• Thank Evans!
• A Combinatorial Theorem with an Application to Latin Rectangles

This page was built for publication: On the intricacy of avoiding multiple-entry arrays