Name
Abstract | ||
|---|---|---|
It is well known that all nxn partial Latin squares with at most n-1 entries are completable. Our intent is to extend this well known statement to partial Latin cubes. We show that if an nxnxn partial Latin cube contains at most n-1 entries, no two of which occupy the same row, then the partial Latin cube is completable. Also included in this paper is the problem of completing 2xnxn partial Latin boxes with at most n-1 entries. Given certain sufficient conditions, we show when such partial Latin boxes are completable and then extendable to a deeper Latin box. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejc.2011.05.003 | Eur. J. Comb. |
Keywords | Field | DocType |
certain sufficient condition,partial latin box,latin box,n-1 entry,nxnxn partial latin cube,nxn partial latin square,partial latin cube,latin square | Discrete mathematics,Combinatorics,Latin square,Mathematics,Cube | Journal |
Volume | Issue | ISSN |
32 | 8 | 0195-6698 |
Citations | PageRank | References |
2 | 0.40 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaromy Kuhl | 1 | 10 | 4.72 |
| Tristan Denley | 2 | 34 | 6.77 |