Yehuda Roditty

According to our database, Yehuda Roditty authored at least 44 papers between 1983 and 2017.

Collaborative distances:

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

2017

New upper bound on <i>m</i>-time-relaxed <i>k</i>-broadcast graphs.

Amir Averbuch, Irete Peeri, Yehuda Roditty

Networks, 2017

On the rainbow connection number of graphs.

Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon

Ars Comb., 2017

2016

Line-broadcasting in complete <i>k</i>-ary trees.

Revital Hollander Shabtai, Yehuda Roditty

Networks, 2016

Anti-Ramsey Numbers of Graphs with Small Connected Components.

Shoni Gilboa, Yehuda Roditty

Graphs Comb., 2016

2015

Line-Broadcasting in Complete k-Trees.

Revital Hollander Shabtai, Yehuda Roditty

CoRR, 2015

Anti-Ramsey numbers of small graphs.

Arie Bialostocki, Shoni Gilboa, Yehuda Roditty

Ars Comb., 2015

2014

Efficient construction of broadcast graphs.

Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty

Discret. Appl. Math., 2014

2009

On zero-sum partitions and anti-magic trees.

Gil Kaplan, Arieh Lev, Yehuda Roditty

Discret. Math., 2009

The depression of a graph and the diameter of its line graph.

Iris Gaber-Rosenblum, Yehuda Roditty

Discret. Math., 2009

On graph labeling problems and regular decompositions of complete graphs.

Gil Kaplan, Arieh Lev, Yehuda Roditty

Ars Comb., 2009

2008

Bertrand's postulate, the prime number theorem and product anti-magic graphs.

Gil Kaplan, Arieh Lev, Yehuda Roditty

Discret. Math., 2008

On Rainbow Connection.

Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster

Electron. J. Comb., 2008

2004

Dense graphs are antimagic.

Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster

J. Graph Theory, 2004

A note: some results in step domination of trees.

Gideon Dror, Arieh Lev, Yehuda Roditty

Discret. Math., 2004

Connected colorings of graphs.

Yair Caro, Yehuda Roditty

Ars Comb., 2004

2003

Some results in step domination of graphs.

Yair Caro, Arieh Lev, Yehuda Roditty

Ars Comb., 2003

2002

Transitive large sets of disjoint decompositions and group sequencings.

Gil Kaplan, Arieh Lev, Yehuda Roditty

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

2001

Low-cost minimum-time line-broadcasting schemes in complete binary trees.

Amir Averbuch, Iris Gaber, Yehuda Roditty

Networks, 2001

Regular Oberwolfach Problems and Group Sequencings.

Gil Kaplan, Arieh Lev, Yehuda Roditty

J. Comb. Theory, Ser. A, 2001

Monotone paths in edge-ordered sparse graphs.

Yehuda Roditty, Barack Shoham, Raphael Yuster

Discret. Math., 2001

Efficient line broadcasting in a d-dimensional grid.

Amir Averbuch, Yehuda Roditty, Barack Shoham

Discret. Appl. Math., 2001

All Cycles are Edge-Magic.

Omer Berkman, Michal Parnas, Yehuda Roditty

Ars Comb., 2001

2000

On Hering Decomposition of<i>DK_n</i>Induced by Group Actions on Conjugacy Classes.

Arieh Lev, Yehuda Roditty

Eur. J. Comb., 2000

Performance analysis of hybrid network multiprocessor architecture.

Amir Averbuch, Yehuda Roditty, Barack Shoham

Concurr. Pract. Exp., 2000

Covering designs with minimum overlap.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Ars Comb., 2000

Improved bounds for the product of the domination and chromatic numbers of a graph.

Yair Caro, Yehuda Roditty

Ars Comb., 2000

1999

Scheduling tasks of multi-join queries in a multiprocessor.

Amir Averbuch, Yehuda Roditty, Barack Shoham

Concurr. Pract. Exp., 1999

1997

On a Reconstruction Problem for Sequences, .

Ilia Krasikov, Yehuda Roditty

J. Comb. Theory, Ser. A, 1997

On colored designs - I.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Discret. Math., 1997

On Broadcasting Multiple Messages in a D-dimensional Grid.

Yehuda Roditty, Barack Shoham

Discret. Appl. Math., 1997

1996

Packing and covering of the complete graph, V: the forests of order six and their multiple copies.

Yehuda Roditty

Ars Comb., 1996

1995

On colored designs - II.

Yair Caro, Yehuda Roditty, Johanan Schönheim

Discret. Math., 1995

A zero-sum conjecture for trees.

Yair Caro, Yehuda Roditty

Ars Comb., 1995

1994

Bounds for the harmonious chromatic number of a graph.

Ilia Krasikov, Yehuda Roditty

J. Graph Theory, 1994

More on Vertex-Switching Reconstruction.

Ilia Krasikov, Yehuda Roditty

J. Comb. Theory, Ser. B, 1994

On induced subgraphs of trees, with restricted degrees.

Yair Caro, Ilia Krasikov, Yehuda Roditty

Discret. Math., 1994

1992

Switching reconstruction and diophantine equations.

Ilia Krasikov, Yehuda Roditty

J. Comb. Theory, Ser. B, 1992

1991

On the largest tree of given maximum degree in a connected graph.

Yair Caro, Ilia Krasikov, Yehuda Roditty

J. Graph Theory, 1991

1990

Some applications of the nash-williams lemma to the edge-reconstruction conjecture.

Ilia Krasikov, Yehuda Roditty

Graphs Comb., 1990

A note on packing trees into complete bipartite graphs and on fishburn's conjecture.

Yair Caro, Yehuda Roditty

Discret. Math., 1990

1989

Combinatorial reconstruction problems.

Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty

J. Comb. Theory, Ser. B, 1989

1987

Reconstructing graphs from their <i>k</i>-edge deleted subgraphs.

Chris D. Godsil, Ilia Krasikov, Yehuda Roditty

J. Comb. Theory, Ser. B, 1987

1983

Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less.

Yehuda Roditty

J. Comb. Theory, Ser. A, 1983