Search the dblp DataBase
J. Schönheim :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Yair Caro , Yehuda Roditty , J. Schönheim Covering designs with minimum overlap. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2000, v:55, n:, pp:- [Journal ] Yair Caro , Yehuda Roditty , J. Schönheim On colored designs-III: on lambda-colored H -designs, H having lambda edges. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:247, n:1-3, pp:51-64 [Journal ] J. Schönheim A Generalization of Results of P. Erdös, G. Katona, and D. J. Kleitman concerning Sperner's Theorem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1971, v:11, n:2, pp:111-117 [Journal ] Yair Caro , J. Schönheim Generalized 1-factorization of trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1981, v:33, n:3, pp:319-321 [Journal ] Ilia Krasikov , J. Schönheim The reconstruction of a tree from its number deck. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:53, n:, pp:137-145 [Journal ] Jason I. Brown , David Kelly , J. Schönheim , Robert E. Woodrow Graph coloring satisfying restraints. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:80, n:2, pp:123-143 [Journal ] Yair Caro , Yehuda Roditty , J. Schönheim On colored designs - I. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:164, n:1-3, pp:47-65 [Journal ] Yair Caro , Yehuda Roditty , J. Schönheim On colored designs - II. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:138, n:1-3, pp:177-186 [Journal ] Ilia Krasikov , J. Schönheim On near subgroups. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:124, n:1-3, pp:133-136 [Journal ] Search in 0.003secs, Finished in 0.003secs