Classifying generalized Howell designs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5130683 (Why is no real title available?)
- scientific article; zbMATH DE number 3485815 (Why is no real title available?)
- scientific article; zbMATH DE number 3545673 (Why is no real title available?)
- scientific article; zbMATH DE number 3572182 (Why is no real title available?)
- scientific article; zbMATH DE number 1161271 (Why is no real title available?)
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- scientific article; zbMATH DE number 1760759 (Why is no real title available?)
- scientific article; zbMATH DE number 3893245 (Why is no real title available?)
- An efficient semi-Latin square for twelve treatments in blocks of size two
- Backtrack search with isomorph rejection and consistency check
- Bounds for permutation arrays
- Classification algorithms for codes and designs
- Enumeration of MOLS of small order
- Enumeration of semi-Latin squares
- Equidistant codes with distance 12
- Every SOMA\((n - 2, n)\) is Trojan
- Existence of generalized Howell designs of side n+1 and order 3n
- Isometries and Construction of Permutation Arrays
- Isomorph-Free Exhaustive Generation
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
- On generalized Howell designs with block size three
- On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
- On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares
- Practical graph isomorphism. II.
- Switching 3-edge-colorings of cubic graphs
- The CRC handbook of combinatorial designs
- The Steiner triple systems of order 19
- The Symmetric Group as Metric Space
- Variability of Room squares
Cited in
(1)
This page was built for publication: Classifying generalized Howell designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892143)