Largest minimal blocking sets in PG(2,8).
- Published in:
- Journal of Combinatorial Designs, 2003, v. 11, n. 3, p. 162, doi. 10.1002/jcd.10035
- By:
- Publication type:
- Article
Works matching IS 10638539 AND DT 2003 AND VI 11 AND IP 3
Results: 5
1
2
Homogeneous and ultrahomogeneous Steiner systems.
- Published in:
- Journal of Combinatorial Designs, 2003, v. 11, n. 3, p. 153, doi. 10.1002/jcd.10034
- By:
- Publication type:
- Article
3
New families of strongly regular graphs.
- Published in:
- Journal of Combinatorial Designs, 2003, v. 11, n. 3, p. 208, doi. 10.1002/jcd.10038
- By:
- Publication type:
- Article
4
On asymmetric coverings and covering numbers.
- Published in:
- Journal of Combinatorial Designs, 2003, v. 11, n. 3, p. 218, doi. 10.1002/jcd.10022
- By:
- Publication type:
- Article
5
Decomposition of the complete graph plus a 1-factor into cycles of equal length.
- Published in:
- Journal of Combinatorial Designs, 2003, v. 11, n. 3, p. 170, doi. 10.1002/jcd.10019
- By:
- Publication type:
- Article