Constrained completion of partial Latin squares

DOI10.1016/J.DISC.2011.10.025zbMATH Open1290.05043OpenAlexW2154749105MaRDI QIDQ409474FDOQ409474

Jaromy Kuhl, Tristan Denley

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.025

zbMATH Keywords

partial Latin square cube box

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Combinatorial Theorem with an Application to Latin Rectangles
• Avoiding partial Latin squares and intricacy
• A few remarks on avoiding partial Latin squares.
• Title not available (Why is that?)
• Degrees giving independent edges in a hypergraph
• Partial Latin squares are avoidable

Cited In (5)

• Title not available (Why is that?)
• The complexity of completing partial Latin squares
• On maximal premature partial Latin squares
• Title not available (Why is that?)
• Restricted completion of sparse partial Latin squares

This page was built for publication: Constrained completion of partial Latin squares

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