When is an incomplete 3× n latin rectangle completable?

DOI10.7151/dmgt.1648zbMath1290.05040OpenAlexW2008940346MaRDI QIDQ2866449

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

zbMATH Keywords

branch-and-boundcompletabilityincomplete Latin rectanglesolution space enumeration

Mathematics Subject Classification ID

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

Related Items (2)

On the completability of incomplete orthogonal Latin rectangles ⋮ Unnamed Item

This page was built for publication: When is an incomplete 3× n latin rectangle completable?