On the completability of incomplete orthogonal Latin rectangles
DOI10.1016/J.DISC.2016.02.008zbMATH Open1333.05043OpenAlexW2295710975MaRDI QIDQ267209FDOQ267209
Authors: G. Appa, Reinhardt Euler, Anastasia Kouvela, Dimitrios Magos, Ioannis Mourtos
Publication date: 8 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.008
Recommendations
orthogonalitypolyhedral combinatorics2-row Latin rectanglecircuitcompletabilitylifted circuit inequality
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Title not available (Why is that?)
- On the generation of circuits and minimal forbidden sets
- On multi-index assignment polytopes
- On the number of Latin squares
- When is an incomplete \(3 \times n\) Latin rectangle completable
- Title not available (Why is that?)
- 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
- Counting Latin rectangles
- On the facial structure of set packing polyhedra
- An existence theorem for latin squares
- The complexity of completing partial Latin squares
- On the completability of incomplete Latin squares
- The many formulae for the number of Latin rectangles
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)