On the intricacy of avoiding multiple-entry arrays

DOI10.1016/J.DISC.2012.07.003zbMATH Open1251.05025OpenAlexW2039296700MaRDI QIDQ456895FDOQ456895

Authors: 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

Recommendations

• Avoiding multiple entry arrays
• The intricacy of avoiding arrays is 2
• On avoiding some families of arrays
• Detecting arrays and their optimality
• scientific article
• On efficient entreeings
• Publication:3197814
• On the Redundancy of Succinct Data Structures

zbMATH Keywords

constraint satisfactionLatin squarelist-coloring

Mathematics Subject Classification ID

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

Cites Work

• Thank Evans!
• Title not available (Why is that?)
• The list chromatic index of a bipartite multigraph
• A Combinatorial Theorem with an Application to Latin Rectangles
• Avoiding partial Latin squares and intricacy
• Avoidable partial Latin squares of order \(4m+1\).
• Partial Latin squares are avoidable
• A note on Latin squares with restricted support
• The intricacy of avoiding arrays is 2
• Latin squares with forbidden entries
• A note on completing Latin squares
• On the intricacy of combinatorial construction problems

Cited In (4)

• Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
• Title not available (Why is that?)
• On avoiding some families of arrays
• The intricacy of avoiding arrays is 2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456895)