When is an incomplete 3 n Latin rectangle completable

DOI10.7151/DMGT.1648zbMATH Open1290.05040OpenAlexW2008940346MaRDI QIDQ2866449FDOQ2866449

Authors: Paweł Oleksik, Reinhardt Euler 

Publication date: 13 December 2013

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1648

Recommendations

• On the completability of incomplete Latin squares
• On the completion of latin rectangles to symmetric latin squares
• Completing some partial Latin squares
• A note on completing Latin squares
• On the completability of incomplete orthogonal Latin rectangles

zbMATH Keywords

completabilitybranch-and-boundincomplete Latin rectanglesolution space enumeration

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Hypergraphs (05C65)

Cited In (3)

• On the completability of incomplete orthogonal Latin rectangles
• On the completability of incomplete Latin squares
• Title not available (Why is that?)

This page was built for publication: When is an incomplete \(3 \times n\) Latin rectangle completable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866449)