scientific article; zbMATH DE number 7535772
From MaRDI portal
Publication:5863474
Recommendations
- On the completability of incomplete Latin squares
- scientific article; zbMATH DE number 1556753
- The complexity of completing partial Latin squares
- scientific article; zbMATH DE number 2170410
- scientific article; zbMATH DE number 3887704
- Completions of -dense partial Latin squares
- Constrained completion of partial Latin squares
- scientific article; zbMATH DE number 3103360
- On the complexity of certain completion problems
Cites work
- A Combinatorial Theorem with an Application to Latin Rectangles
- Completing partial Latin squares with blocks of non-empty cells
- Completing some partial Latin squares
- Embedding Incomplete Latin Squares
- scientific article; zbMATH DE number 3737686 (Why is no real title available?)
- On the intricacy of combinatorial construction problems
- Thank Evans!
- When is an incomplete 3 n Latin rectangle completable
Cited in
(11)- Enumeration of Latin arrays. I: Case \(n\leq 3\)
- Enumeration of Latin arrays. II: Case \(n=4\), \(k\leq 4\)
- Induced subarrays of Latin squares without repeated symbols
- Decomposition of bicolored square arrays into bichromatic diagonals
- Decomposition of bi-colored square arrays into balanced diagonals
- scientific article; zbMATH DE number 3887704 (Why is no real title available?)
- scientific article; zbMATH DE number 1529466 (Why is no real title available?)
- scientific article; zbMATH DE number 1743825 (Why is no real title available?)
- scientific article; zbMATH DE number 2170449 (Why is no real title available?)
- Restricted completion of sparse partial Latin squares
- Completing partial Latin squares with blocks of non-empty cells
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863474)
