Yehuda Roditty

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

On the rainbow connection number of graphs.
Ars Comb., 2017

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

Anti-Ramsey Numbers of Graphs with Small Connected Components.
Graphs Comb., 2016

2015
Line-Broadcasting in Complete k-Trees.
CoRR, 2015

Anti-Ramsey numbers of small graphs.
Ars Comb., 2015

2014
Efficient construction of broadcast graphs.
Discret. Appl. Math., 2014

2009
On zero-sum partitions and anti-magic trees.
Discret. Math., 2009

The depression of a graph and the diameter of its line graph.
Discret. Math., 2009

On graph labeling problems and regular decompositions of complete graphs.
Ars Comb., 2009

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

On Rainbow Connection.
Electron. J. Comb., 2008

2004
Dense graphs are antimagic.
J. Graph Theory, 2004

A note: some results in step domination of trees.
Discret. Math., 2004

Connected colorings of graphs.
Ars Comb., 2004

2003
Some results in step domination of graphs.
Ars Comb., 2003

2002
Transitive large sets of disjoint decompositions and group sequencings.
Discret. Math., 2002

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

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

Regular Oberwolfach Problems and Group Sequencings.
J. Comb. Theory A, 2001

Monotone paths in edge-ordered sparse graphs.
Discret. Math., 2001

Efficient line broadcasting in a d-dimensional grid.
Discret. Appl. Math., 2001

All Cycles are Edge-Magic.
Ars Comb., 2001

2000
On Hering Decomposition of<i>DK<sub>n</sub></i>Induced by Group Actions on Conjugacy Classes.
Eur. J. Comb., 2000

Performance analysis of hybrid network multiprocessor architecture.
Concurr. Pract. Exp., 2000

Covering designs with minimum overlap.
Ars Comb., 2000

Improved bounds for the product of the domination and chromatic numbers of a graph.
Ars Comb., 2000

1999
Scheduling tasks of multi-join queries in a multiprocessor.
Concurr. Pract. Exp., 1999

1997
On a Reconstruction Problem for Sequences, .
J. Comb. Theory A, 1997

On colored designs - I.
Discret. Math., 1997

On Broadcasting Multiple Messages in a D-dimensional Grid.
Discret. Appl. Math., 1997

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

1995
On colored designs - II.
Discret. Math., 1995

A zero-sum conjecture for trees.
Ars Comb., 1995

1994
Bounds for the harmonious chromatic number of a graph.
J. Graph Theory, 1994

More on Vertex-Switching Reconstruction.
J. Comb. Theory B, 1994

On induced subgraphs of trees, with restricted degrees.
Discret. Math., 1994

1992
Switching reconstruction and diophantine equations.
J. Comb. Theory B, 1992

1991
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory, 1991

1990
Some applications of the nash-williams lemma to the edge-reconstruction conjecture.
Graphs Comb., 1990

A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
Discret. Math., 1990

1989
Combinatorial reconstruction problems.
J. Comb. Theory B, 1989

1987
Reconstructing graphs from their <i>k</i>-edge deleted subgraphs.
J. Comb. Theory B, 1987

1983
Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less.
J. Comb. Theory A, 1983


  Loading...