| 2002 |
|---|
| 10 | EE | Yair Caro,
Yehuda Roditty,
J. Schönheim:
On colored designs-III: on lambda-colored H-designs, H having lambda edges.
Discrete Mathematics 247(1-3): 51-64 (2002) |
| 9 | EE | Stefan Porubský,
J. Schönheim:
New necessary and sufficient conditions on (ai, mi) in order that x = ai (mod mi) be a covering system.
Electronic Notes in Discrete Mathematics 11: 562-566 (2002) |
| 2000 |
|---|
| 8 | | Yair Caro,
Yehuda Roditty,
J. Schönheim:
Covering designs with minimum overlap.
Ars Comb. 55: (2000) |
| 1997 |
|---|
| 7 | EE | Yair Caro,
Yehuda Roditty,
J. Schönheim:
On colored designs - I.
Discrete Mathematics 164(1-3): 47-65 (1997) |
| 1995 |
|---|
| 6 | EE | Yair Caro,
Yehuda Roditty,
J. Schönheim:
On colored designs - II.
Discrete Mathematics 138(1-3): 177-186 (1995) |
| 1994 |
|---|
| 5 | EE | Ilia Krasikov,
J. Schönheim:
On near subgroups.
Discrete Mathematics 124(1-3): 133-136 (1994) |
| 1990 |
|---|
| 4 | EE | Jason I. Brown,
David Kelly,
J. Schönheim,
Robert E. Woodrow:
Graph coloring satisfying restraints.
Discrete Mathematics 80(2): 123-143 (1990) |
| 1985 |
|---|
| 3 | EE | Ilia Krasikov,
J. Schönheim:
The reconstruction of a tree from its number deck.
Discrete Mathematics 53: 137-145 (1985) |
| 1981 |
|---|
| 2 | EE | Yair Caro,
J. Schönheim:
Generalized 1-factorization of trees.
Discrete Mathematics 33(3): 319-321 (1981) |
| 1971 |
|---|
| 1 | | J. Schönheim:
A Generalization of Results of P. Erdös, G. Katona, and D. J. Kleitman concerning Sperner's Theorem.
J. Comb. Theory, Ser. A 11(2): 111-117 (1971) |
