The cycle switching graph of the Steiner triple systems of order 19 is connected
From MaRDI portal
Publication:659722
DOI10.1007/S00373-010-0982-1zbMATH Open1233.05050OpenAlexW2064550979MaRDI QIDQ659722FDOQ659722
Authors: Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård 
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
Recommendations
Cites Work
- Introduction to algorithms
- Undirected connectivity in log-space
- Classification algorithms for codes and designs
- Small latin squares, quasigroups, and loops
- Generating uniformly distributed random latin squares
- On 6-sparse Steiner triple systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonexistence of perfect Steiner triple systems of order 19 and 21
- Random strongly regular graphs?
- Cycle switches in Latin squares
- Properties of the Steiner triple systems of order 19
- The Steiner triple systems of order 19
- A catalogue of the Steiner triple systems of order 19
- THE 7 × 7 SQUARES
Cited In (10)
- Enumerating cube tilings
- Title not available (Why is that?)
- Pasch trades with a negative block
- On triple systems and strongly regular graphs
- Properties of Steiner triple systems of order 21
- Generating Uniformly Distributed Random 2-Designs with Block Size 3
- Switching for Small Strongly Regular Graphs
- Switching in one-factorisations of complete graphs
- Switching 3-edge-colorings of cubic graphs
- Rigid Steiner Triple Systems Obtained from Projective Triple Systems
Uses Software
This page was built for publication: The cycle switching graph of the Steiner triple systems of order 19 is connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659722)
