On the completability of incomplete orthogonal Latin rectangles
From MaRDI portal
(Redirected from Publication:267209)
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1455120 (Why is no real title available?)
- An existence theorem for latin squares
- Counting Latin rectangles
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- On multi-index assignment polytopes
- On the completability of incomplete Latin squares
- On the facial structure of set packing polyhedra
- On the generation of circuits and minimal forbidden sets
- On the number of Latin squares
- The complexity of completing partial Latin squares
- The many formulae for the number of Latin rectangles
- When is an incomplete \(3 \times n\) Latin rectangle completable
Cited in
(5)
This page was built for publication: On the completability of incomplete orthogonal Latin rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267209)