Pages that link to "Item:Q3835459"
From MaRDI portal
The following pages link to On the minimum number of blocks defining a design (Q3835459):
Displaying 14 items.
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs (Q604662) (← links)
- On defining sets of full designs (Q710602) (← links)
- A flaw in the use of minimal defining sets for secret sharing schemes (Q851751) (← links)
- On defining sets of full designs with block size three (Q968222) (← links)
- Random constructions and density results (Q1009013) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- Defining sets of full designs with block size three. II (Q1928575) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- On the spectrum of minimal defining sets of full designs (Q2441344) (← links)
- On defining sets for projective planes (Q2576848) (← links)
- (Q3126454) (← links)
- Complete forcing numbers of complete and almost-complete multipartite graphs (Q6053962) (← links)
