Recommendations
Cites work
- A note on Latin squares with restricted support
- Avoidable partial Latin squares of order 4m+1.
- Avoiding multiple entry arrays
- Avoiding partial Latin squares and intricacy
- Chessboard squares
- scientific article; zbMATH DE number 5704250 (Why is no real title available?)
- scientific article; zbMATH DE number 3737686 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- Latin squares with forbidden entries
- NP completeness of the edge precoloring extension problem on bipartite graphs
- Partial Latin squares are avoidable
- Thank Evans!
- The complexity of completing partial Latin squares
Cited in
(14)- Chessboard squares
- Avoiding pairs of partial Latin squares
- Avoiding and extending partial edge colorings of hypercubes
- Restricted cycle factors and arc-decompositions of digraphs
- The intricacy of avoiding arrays is 2
- Latin squares with forbidden entries
- scientific article; zbMATH DE number 5704250 (Why is no real title available?)
- Avoiding (m,m,m)-arrays of order n=2ᵏ
- Avoiding multiple entry arrays
- On the intricacy of avoiding multiple-entry arrays
- Avoiding Arrays of Odd Order by Latin Squares
- Restricted completion of sparse partial Latin squares
- Brooks' theorem with forbidden colors
- Latin cubes with forbidden entries
This page was built for publication: On avoiding some families of arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764884)
