Restricted completion of sparse partial Latin squares
From MaRDI portal
Publication:5222548
DOI10.1017/S096354831800055XzbMath1436.05022arXiv1608.07383MaRDI QIDQ5222548
Lina J. Andrén, Carl Johan Casselgren, Klas Markström
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07383
Related Items (5)
Avoiding and extending partial edge colorings of hypercubes ⋮ Restricted extension of sparse partial edge colorings of complete graphs ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Optimality analysis on partial \(l_1\)-minimization recovery ⋮ Latin cubes of even order with forbidden entries
Cites Work
- Completing partial Latin squares with one nonempty row, column, and symbol
- Constrained completion of partial Latin squares
- Partial Latin squares are avoidable
- On avoiding some families of arrays
- The complexity of completing partial Latin squares
- Completing partial Latin squares with two filled rows and two filled columns
- A note on Latin squares with restricted support
- Avoiding partial Latin squares and intricacy
- Chessboard squares
- Completing partial Latin squares with one filled row, column and symbol
- Clique decompositions of multipartite graphs and completion of Latin squares
- Latin squares with forbidden entries
- Completions of ε-Dense Partial Latin Squares
- Embedding Incomplete Latin Squares
- Avoiding multiple entry arrays
- Avoiding Arrays of Odd Order by Latin Squares
- A Combinatorial Theorem with an Application to Latin Rectangles
- A generalization of transversals for Latin squares
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Restricted completion of sparse partial Latin squares