The cycle switching graph of the Steiner triple systems of order 19 is connected
From MaRDI portal
(Redirected from Publication:659722)
Recommendations
Cites work
- scientific article; zbMATH DE number 5130670 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 2104717 (Why is no real title available?)
- scientific article; zbMATH DE number 1404121 (Why is no real title available?)
- scientific article; zbMATH DE number 3104192 (Why is no real title available?)
- A catalogue of the Steiner triple systems of order 19
- Classification algorithms for codes and designs
- Cycle switches in Latin squares
- Generating uniformly distributed random latin squares
- Introduction to algorithms
- Nonexistence of perfect Steiner triple systems of order 19 and 21
- On 6-sparse Steiner triple systems
- Properties of the Steiner triple systems of order 19
- Random strongly regular graphs?
- Small latin squares, quasigroups, and loops
- THE 7 × 7 SQUARES
- The Steiner triple systems of order 19
- Undirected connectivity in log-space
Cited in
(10)- Enumerating cube tilings
- Rigid Steiner triple systems obtained from projective triple systems
- Switching for small strongly regular graphs
- Generating Uniformly Distributed Random 2-Designs with Block Size 3
- Pasch trades with a negative block
- On triple systems and strongly regular graphs
- Properties of Steiner triple systems of order 21
- Switching in one-factorisations of complete graphs
- scientific article; zbMATH DE number 1404121 (Why is no real title available?)
- Switching 3-edge-colorings of cubic graphs
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)