Almost resolvable k‐cycle systems with.
- Published in:
- Journal of Combinatorial Designs, 2018, v. 26, n. 10, p. 480, doi. 10.1002/jcd.21608
- By:
- Publication type:
- Article
Works matching IS 10638539 AND DT 2018 AND VI 26 AND IP 10
Results: 5
1
2
Partitioning the edge set of a hypergraph into almost regular cycles.
- Published in:
- Journal of Combinatorial Designs, 2018, v. 26, n. 10, p. 465, doi. 10.1002/jcd.21610
- By:
- Publication type:
- Article
3
Small arrays of maximum coverage.
- Published in:
- Journal of Combinatorial Designs, 2018, v. 26, n. 10, p. 487, doi. 10.1002/jcd.21609
- By:
- Publication type:
- Article
4
Normalized difference set tiling conjecture.
- Published in:
- Journal of Combinatorial Designs, 2018, v. 26, n. 10, p. 505, doi. 10.1002/jcd.21606
- By:
- Publication type:
- Article
5
Issue Information.
- Published in:
- Journal of Combinatorial Designs, 2018, v. 26, n. 10, p. 464, doi. 10.1002/jcd.21581
- Publication type:
- Article