Johanan Schönheim

According to our database, Johanan Schönheim authored at least 20 papers between 1968 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

New necessary and sufficient conditions on (a_i, m_i) in order that x = a_i (mod m_i) be a covering system.

Stefan Porubský, Johanan Schönheim

Electron. Notes Discret. Math., 2002

On colored designs-III: on lambda-colored <i>H</i>-designs, <i>H</i> having lambda edges.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Discret. Math., 2002

2000

Covering designs with minimum overlap.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Ars Comb., 2000

1997

On colored designs - I.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Discret. Math., 1997

1995

On colored designs - II.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Discret. Math., 1995

On the colorability of graphs decomposable into degenerate graphs with specified degeneracy.

R. Klein, Johanan Schönheim

Australas. J Comb., 1995

1994

On near subgroups.

Ilia Krasikov, Johanan Schönheim

Discret. Math., 1994

1990

Graph coloring satisfying restraints.

Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow

Discret. Math., 1990

1985

Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.

Fanica Gavril, Johanan Schönheim

J. Algorithms, 1985

The reconstruction of a tree from its number deck.

Ilia Krasikov, Johanan Schönheim

Discret. Math., 1985

1983

On a Generalized Matching Problem Arising in Estimating the Eigenvalue Variation of Two Matrices.

Ludwig Elsner, Charles R. Johnson, J. A. Ross, Johanan Schönheim

Eur. J. Comb., 1983

1982

Characterization and algorithms of curve map graphs.

Fanica Gavril, Johanan Schönheim

Discret. Appl. Math., 1982

1981

Generalized 1-factorization of trees.

Yair Caro, Johanan Schönheim

Discret. Math., 1981

1977

G-decomposition of K_n, where G has four vertices or less.

Jean-Claude Bermond, Johanan Schönheim

Discret. Math., 1977

1975

Partition of the edges of the directed complete graph into 4-cycles.

Johanan Schönheim

Discret. Math., 1975

1972

On certain sets of divisors of a number.

M. Herzog, Johanan Schönheim

Discret. Math., 1972

1971

Linear and Nonlinear Single-Error-Correcting Perfect Mixed Codes

M. Herzog, Johanan Schönheim

Inf. Control., May, 1971

A Generalization of Results of P. Erdös, G. Katona, and D. J. Kleitman concerning Sperner's Theorem.

Johanan Schönheim

J. Comb. Theory A, 1971

1969

Semilinear Codes and Some Combinatorial Applications of Them

Johanan Schönheim

Inf. Control., July, 1969

1968

On Linear and Nonlinear Single-Error-Correcting q-nary Perfect Codes

Johanan Schönheim

Inf. Control., January, 1968