Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
J. Schönheim
2000 – 2009
- 2002
[j10]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)- [j9]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
- [j8]
1990 – 1999
- 1997
- [j7]Yair Caro, Yehuda Roditty, J. Schönheim: On colored designs - I. Discrete Mathematics 164(1-3): 47-65 (1997)
- 1995
- [j6]Yair Caro, Yehuda Roditty, J. Schönheim: On colored designs - II. Discrete Mathematics 138(1-3): 177-186 (1995)
- 1994
- [j5]
- 1990
- [j4]Jason I. Brown, David Kelly, J. Schönheim, Robert E. Woodrow: Graph coloring satisfying restraints. Discrete Mathematics 80(2): 123-143 (1990)
1980 – 1989
- 1985
- [j3]Ilia Krasikov, J. Schönheim: The reconstruction of a tree from its number deck. Discrete Mathematics 53: 137-145 (1985)
- 1981
- [j2]Yair Caro, J. Schönheim: Generalized 1-factorization of trees. Discrete Mathematics 33(3): 319-321 (1981)
1970 – 1979
- 1971
- [j1]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)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 16:00 CEST by the dblp team