Constrained completion of partial Latin squares
From MaRDI portal
Publication:409474
DOI10.1016/J.DISC.2011.10.025zbMATH Open1290.05043OpenAlexW2154749105MaRDI QIDQ409474FDOQ409474
Authors: Tristan Denley, Jaromy Kuhl
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
Recommendations
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.
- Avoidable partial Latin squares of order \(4m+1\).
- Degrees giving independent edges in a hypergraph
- Partial Latin squares are avoidable
Cited In (7)
- 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?)
- When is a partial Latin square uniquely completable, but not its completable product?
- 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)