Latin Square Completion

Latin Square Completion is a combinatorial problem in design theory that involves determining whether a partially filled Latin square can be extended to a complete Latin square by filling in the remaining entries while satisfying the constraint that each symbol appears exactly once in each row and each column.

28

Publications

952

Citations

47

Authors

39

Institutions

Publications per year

2017–2026

3

Authors

47

  1. MG
    Martin Grüttmüller

    University of Rostock, Germany

    2 publications · 23 citations

    2

    h-index

  2. NJ
    Nicholas J. Cavenagh

    The University of Queensland, Australia

    2 publications · 29 citations

    2

    h-index

  3. DD
    Diane Donovan

    The University of Queensland, Australia

    2 publications · 66 citations

    2

    h-index

  4. MA
    M. A. Ollis

    Marlboro College, United States

    1 publications · 39 citations

    1

    h-index

  5. PJ
    Peter J. Dukes

    University of Victoria, Canada

    1 publications · 11 citations

    1

    h-index

1–5 of 47

Venues

  1. Journal of Combinatorial Theory Series A

    6 publications · 110 citations

    6

    h-index

  2. Journal of Combinatorial Designs

    JCD · 5 publications · 85 citations

    5

    h-index

  3. Canadian Mathematical Bulletin

    CMB · 3 publications · 60 citations

    3

    h-index

  4. Discrete Applied Mathematics

    3 publications · 230 citations

    3

    h-index

  5. European Journal of Combinatorics

    1 publications · 11 citations

    1

    h-index

1–5