Recommendations
Cites work
- scientific article; zbMATH DE number 68556 (Why is no real title available?)
- scientific article; zbMATH DE number 540103 (Why is no real title available?)
- scientific article; zbMATH DE number 638683 (Why is no real title available?)
- scientific article; zbMATH DE number 4198000 (Why is no real title available?)
- Constructing defining sets of full designs
- Defining sets of full designs with block size three. II
- Edge partitions of the complete symmetric directed graph and related designs
- Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
- On defining sets of full designs and of designs related to them
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- On orthogonal double covers of graphs
- On the minimum number of blocks defining a design
- The spectrum of minimal defining sets of some Steiner systems
Cited in
(12)- On the spectrum of minimal defining sets of full designs
- A method for constructing defining sets of all \((v,k,\lambda)\) designs
- Critical sets of full \(n\)-Latin squares
- scientific article; zbMATH DE number 5302250 (Why is no real title available?)
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- Constructing defining sets of full designs
- On defining sets of full designs and of designs related to them
- On defining sets of full designs with block size three
- Critical sets of 2-balanced Latin rectangles
- Defining sets of full designs with block size three. II
- Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
- Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
This page was built for publication: On defining sets of full designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710602)