The following pages link to Enumeration of semi-Latin squares (Q1356446):
Displaying 16 items.
- Generalized Latin squares of order \(n\) with \(n^2-1\) distinct elements (Q377818) (← links)
- Multi-Latin squares (Q539869) (← links)
- Orthogonal partitions in designed experiments (Q677159) (← links)
- Enumeration formulas for latin and frequency squares (Q686458) (← links)
- Balanced semi-Latin rectangles: properties, existence and constructions for block size two (Q828486) (← links)
- Enumeration of Latin arrays. I: Case \(n\leq 3\) (Q1176064) (← links)
- Enumeration of Latin arrays. II: Case \(n=4\), \(k\leq 4\) (Q1177968) (← links)
- A Howell design admitting \(A_ 5\) (Q1356445) (← links)
- Equivalence classes of matchings and lattice-square designs (Q1765511) (← links)
- Constructions for regular-graph semi-Latin rectangles with block size two (Q2156807) (← links)
- Automating the group-theoretic-based construction procedure for the \((n\times n)/k\) semi-Latin square (Q2770440) (← links)
- Designs, Groups and Computing (Q2841966) (← links)
- An enumeration of spherical latin bitrades (Q5393543) (← links)
- A new construction for efficient semi-Latin squares (Q5950636) (← links)
- Construction of balanced semi-Latin rectangles in block size four: an algorithmic approach (Q6581636) (← links)
- Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs (Q6636522) (← links)
