The cycle switching graph of the Steiner triple systems of order 19 is connected
From MaRDI portal
Publication:659722
DOI10.1007/s00373-010-0982-1zbMath1233.05050OpenAlexW2064550979MaRDI QIDQ659722
Veli Mäkinen, Patric R. J. Östergård, Petteri Kaski
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0982-1
Related Items (8)
Generating Uniformly Distributed Random 2-Designs with Block Size 3 ⋮ Switching 3-edge-colorings of cubic graphs ⋮ Rigid Steiner Triple Systems Obtained from Projective Triple Systems ⋮ Switching for Small Strongly Regular Graphs ⋮ Enumerating cube tilings ⋮ Switching in one-factorisations of complete graphs ⋮ Pasch trades with a negative block ⋮ On triple systems and strongly regular graphs
Uses Software
Cites Work
- Cycle switches in Latin squares
- Classification algorithms for codes and designs
- On 6-sparse Steiner triple systems
- Properties of the Steiner triple systems of order 19
- Small latin squares, quasigroups, and loops
- Undirected connectivity in log-space
- Generating uniformly distributed random latin squares
- The Steiner triple systems of order 19
- THE 7 × 7 SQUARES
- Random strongly regular graphs?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The cycle switching graph of the Steiner triple systems of order 19 is connected