Cycle switches in Latin squares
From MaRDI portal
Publication:704846
DOI10.1007/S00373-004-0567-7zbMATH Open1053.05020OpenAlexW2086303573MaRDI QIDQ704846FDOQ704846
Authors: Ian M. Wanless 
Publication date: 20 January 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-004-0567-7
Recommendations
Cited In (28)
- Parity of transversals of Latin squares
- Switching codes and designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Hamilton transversals in random Latin squares
- Title not available (Why is that?)
- Enumeration of Latin squares with conjugate symmetry
- On triple systems and strongly regular graphs
- Latin bitrades derived from groups
- Mutually orthogonal Sudoku Latin squares and their graphs
- Permanents and determinants of Latin squares
- Diagonally cyclic Latin squares.
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- Switching for 2-designs
- Generating Uniformly Distributed Random 2-Designs with Block Size 3
- Autoparatopisms of Quasigroups and Latin Squares
- Atomic Latin squares of order eleven
- Switching in one-factorisations of complete graphs
- Computing random \(r\)-orthogonal Latin squares
- Atomic Latin squares based on cyclotomic orthomorphisms
- Near-automorphisms of Latin squares
- Isotopy graphs of Latin tableaux
- Minimal homogeneous Latin trades
- The cycle structure of two rows in a random Latin square
- Parity of sets of mutually orthogonal Latin squares
- There are asymptotically the same number of Latin squares of each parity
- How not to prove the Alon-Tarsi conjecture
- Latin squares with a unique intercalate
- The theory and application of latin bitrades: A survey
This page was built for publication: Cycle switches in Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704846)
