On the completability of incomplete Latin squares

DOI10.1016/j.ejc.2009.03.036zbMath1201.05016OpenAlexW2039285221MaRDI QIDQ966163

Reinhardt Euler

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.036

zbMATH Keywords

integer programmingclass teacher time table problemcompletabele Latin squarecomplete Latin squareincomplete Latin square

Mathematics Subject Classification ID

Integer programming (90C10) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

On the completability of incomplete orthogonal Latin rectangles ⋮ A philatelic excursion with Jeff Hunter in probability and matrix theory ⋮ A characterization of odd-hole inequalities related to Latin squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of completing partial Latin squares
• On the orthogonal Latin squares polytope
• A global parallel algorithm for the hypergraph transversal problem
• Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed
• On Latin squares and the facial structure of related polytopes
• Time-tables, polyhedra and the greedy algorithm
• A new class of facets for the Latin square polytope
• Thank Evans!
• Embedding Incomplete Latin Squares
• Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
• Embedding Latin Squares with Prescribed Diagonal
• Facet of regular 0–1 polytopes
• Some Comments On A Note About Timetabling^*
• A Solution to the Embedding Problem for Partial Idempotent Latin Squares
• On the completion of latin rectangles to symmetric latin squares
• On the facial structure of set packing polyhedra
• On Completing Latin Rectangles
• A Combinatorial Theorem with an Application to Latin Rectangles
• An existence theorem for latin squares