Steiner triple systems satisfying the 4-vertex condition
From MaRDI portal
Publication:664381
DOI10.1007/S10623-011-9520-2zbMATH Open1236.05034OpenAlexW2003743811MaRDI QIDQ664381FDOQ664381
Authors: Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård
Publication date: 1 March 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9520-2
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classification algorithms for codes and designs
- 2-\((v,k,\lambda)\) designs of small order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly regular graphs, partial geometries and partially balanced designs
- The Steiner triple systems of order 19
- Two families of strongly regular graphs with the 4-vertex condition
- A criterion for the \(t\)-vertex condition of graphs
- One-factorizations of regular graphs of order 12
- The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition
Cited In (5)
Uses Software
This page was built for publication: Steiner triple systems satisfying the 4-vertex condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664381)