|
82
|
A. Averbuch, L. Kosachevski and Y. Roditty.
Construction of minimumm-Time-Relaxed ($m \geq 1$) broadcast hypergraphs, Submitted.
|
|
81
|
A. Bialostocki, Y. Roditty and R. Zigdon.
On some coloring problems, In preparation.
|
|
80
|
I. Krasikov, Y. Roditty and B.D. Thatte.
New results on the edge-reconstruction Conjecture, Submitted.
|
|
79
|
I. Krasikov, Y. Roditty and B.D. Thatte.
Class reconstruction of trees, Submitted.
|
|
78
|
Y. Roditty and R. Zigdon.
New upper bound of the monotone paths in complete graphs, In preparation.
|
|
77
|
G. Dror, A. Lev, Y. Roditty and R. Zigdon.
On the rainbow connection number of graphs, Ars Combinatoria, volume 133, pages 51–67, 2017.
|
|
76
|
A. Averbuch, I. Peer and Y. Roditty.
New Construction of Minimum $m$-Time-Relaxed $k$-Broadcasting networks, Networks, volume 70, number 2, pages 72–78, June 2017.
|
|
75
|
R. Hollander and Y. Roditty.
Gossiping and Set-To-Set broadcasting in weighted Graphs, J. of Combinatorial Mathematics and Combinatorial Computation, volume 100, pages 9–25, February 2017.
|
|
74
|
S. Gilboa and Y. Roditty.
Anti-Ramsey numbers with small connected components, Graph and Combinatorics, volume 32, number 2, pages 649- 662, 2016.
arxiv
|
|
73
|
R. Hollander and Y. Roditty.
Line broadcasting in complete $k$-ary tree, Networks, volume 62, number 2, pages 139–14, 2016.
arxiv
|
|
72
|
A. Bialostocki, S. Gilboa and Y. Roditty.
Anti-Ramsey numbers of small graphs, Ars Combinatoria, volume 123, pages 41–53, October 2015.
arxiv
|
|
71
|
A. Averbuch, R. Hollander and Y. Roditty.
Efficient construction of broadcast graphs, Discrete Appl. Math, volume 171, pages 9–14, July 2014.
arxiv
|
|
70
|
A. Averbuch, Y. Roditty and N. Zaidenderg.
Peer-2-peer streaming and algorithm for creating spanning trees For peer-2-peer networks, in S. Repin, T. Tichonen and T. Tuovinen (eds.), Numerical methods for Differential Equation, Optimization And Technological problems, pages 363–377, Springer, 2013.
|
|
69
|
A. Averbuch, R. Hollander and Y. Roditty.
$k$-port line-broadcasting in trees, J. of Combinatorial Mathematics and Combinatorial Computation, volume 77, pages 125–160, May 2011.
|
|
68
|
G. Kplan, A. Lev and Y. Roditty.
On zero-sum oartitions and anti-magic trees, Discrete Math., volume 309, pages 2010–2014, 2009.
|
|
67
|
Y. Roditty and I. Rosenblum-Gaber.
The depression of a graph and the diameter of its line graph, Discrete Math., volume 309, pages 1774–1778, 2009.
|
|
66
|
G. Kaplan, A. Lev and Y. Roditty.
On Graph labeling problems and regular factorization of complete graphs, Ars Combinatoria, volume 92, pages 225–243, July 2009.
|
|
65
|
Y. Caro, A. Lev, Y. Roditty, Z. Tuza and R. Yuster.
On rainbow connectivity, Electronic J. of Combinatorics, volume 15, number 1, April 18, 2008.
|
|
64
|
G. Kaplan, A. Lev and Y. Roditty.
Bertrand's Postulate: The Prime number Theorem and product anti-magic graphs, Discrete Math., volume 308, pages 787–794, March 28, 2008.
|
|
63
|
Y. Roditty and Y. Caro.
Connected coloring of graphs, Ars Combinatoria, volume 70, pages 191–196, 2004.
|
|
62
|
G. Dror, A. Lev and Y. Roditty.
A note: some results in step domination of trees, Discrete Math., volume 289, number 1--3, pages 137–144, December 28, 2004.
|
|
61
|
N. Alon, G. Kaplan, A. Lev, Y. Roditty and R. Yuster.
Dense graphs are antimagic, J. of Graph Theory, volume 47, number 4, pages 297–309, October 5, 2004.
|
|
60
|
Y. Caro, A. Lev and Y. Roditty.
Some results on the step domination of a graph, Ars Combinatoria, volume 68, pages 105–114, July 2003.
|
|
59
|
Y. Caro, Y. Roditty and J. Schonheim.
On colored designs –– III: on $\lambda$-colored $H$-designs, $H$ having $\lambda$ edges, Discrete Appl. Math., volume 247, number 1--3, pages 51–64, March 1, 2002.
|
|
58
|
A. Averbuch, Y. Roditty and B. Shoham.
On time-relaxed broadcasting in communication networks, JCMCC, volume 43, pages 123–134, 2002.
|
|
57
|
G. Kaplan, A. Lev and Y. Roditty.
Transitive large sets of disjoint decompositions and group sequensing, Discrete Math, volume 254, number 1--3, pages 207–219, 2002.
|
|
56
|
A. Averbuch, I. Gaber and Y. Roditty.
Low-cost minimum-time line-broadcasting schemes in complete binary trees, Networks, volume 38, number 4, pages 189–193, December 2001.
|
|
55
|
A. Averbuch, Y. Roditty and B. Shoham.
Efficient line broadcasting in a d-dimensional grid, Discrete Appl. Math, volume 113, number 2--3, pages 129–141, October 2001.
|
|
54
|
G. Kaplan, A. Lev and Y. Roditty.
Regular Oberwolfach problems and group sequencing, J. Combin. Theory (Ser A), volume 96, number 1, pages 1–19, October 2001.
|
|
53
|
I. Krasikov and Y. Roditty.
On some Ramsey numbers of unicyclic graphs, Bulletin of the ICA, volume 33, pages 29–34, September 2001.
|
|
52
|
O. Berkman, M. Parnas and Y. Roditty.
All cycles are edge-magic, Ars Combinatoria, volume 59, pages 145–151, April 2001.
|
|
51
|
Y. Roditty, B. Shoham and R. Yuster.
Monotone paths in edge-ordered sparse graphs, Discrete Math, volume 226, number 1--3, pages 411–427, January 6, 2001.
|
|
50
|
A. Averbuch, Y. Roditty and B. Shoham.
Computation of broadcasting multiple messages in a positive weighted tree, J. Combin. Math. Combin. Computation, volume 11, pages 161–183, 2000.
|
|
49
|
T. Bachar and Y. Roditty.
A note on edge-magic cycles, Bulletin of the ICA, volume 29, pages 94–97, 2000.
|
|
48
|
A. Averbuch, Y. Roditty and B. Shoham.
Performance analysis of hybrid network multiprocessor architecture, Concurrency: Practice and Experience, volume 12, number 9, pages 821–844, August 22, 2000.
|
|
47
|
Y. Caro and Y. Roditty.
Improved bounds for the product of the domination and chromatic numbers of a graph, Ars Combinatoria, volume 56, pages 189–191, July 2000.
|
|
46
|
Y. Caro, Y. Roditty and J. Schonheim.
Covering designs with minimum overlap, Ars Combinatoria, volume 55, pages 3–23, April 2000.
|
|
45
|
A. Lev and Y. Roditty.
On Hering decomposition of $DK_n$ induced by group actions on conjugancy classes, European J. Of Combinatorics, volume 21, number 3, pages 379–393, March 2000.
|
|
44
|
A. Averbuch, Y. Roditty and B. Shoham.
Scheduling tasks of multi-join queries in a multiprocessor, Concurrency: Practice and Experience, volume 11, number 5, pages 247–279, April 30, 1999.
|
|
43
|
Y. Roditty and B. Shoham.
On Broadcasting multiple messages in a d-dimensional grid, Discrete Appl. Math., volume 75, number 3, pages 277–284, June 6, 1997.
|
|
42
|
I. Krasikov and Y. Roditty.
On reconstruction problem for sequences, J. Combin. Theory (Ser A), volume 77, number 2, pages 344–348, February 1997.
|
|
41
|
Y. Caro, Y. Roditty and J. Schonheim.
On colored designs — I, Discrete Math., volume 164, number 1--3, pages 47–65, February 10, 1997.
|
|
40
|
Y. Roditty.
One problem –- two solutions in Euclidean Geometry, Int. J. Math. Edu. Sci. Tech., volume 27, pages 313–317, 1996.
|
|
39
|
Y. Roditty.
Packing and covering of the complete graph V: The forests of order six and their multiple copies, Ars Combinatoria, volume 44, pages 55–64, December 1996.
|
|
38
|
Y. Caro and Y. Roditty.
On zero-sum Turan numbers for trees, Ars Combinatoria, volume 40, pages 89–96, August 1995.
|
|
37
|
Y. Caro, Y. Roditty and J. Schonheim.
On colored designs – II, Discrete Math., volume 138, number 1--3, pages 177–186, March 6, 1995.
|
|
36
|
Y. Caro, I. Krasikov and Y. Roditty.
A zero-sum partition theorem for graphs, Int. J. Math. Math. Sci., volume 17, pages 697–702, 1994.
|
|
35
|
I. Krasikov and Y. Roditty.
Bounds on the harmonious chromatic number of a graph, J. Graph Theory, volume 18, number 2, pages 205–209, March 1994.
|
|
34
|
Y. Caro, I. Krasikov and Y. Roditty.
On induced subtrees of a tree with odd degrees., Discrete Math., volume 125, number 1--3, pages 101–106, February 15, 1994.
|
|
33
|
Y. Caro and Y. Roditty.
Acyclic edge-colorings of sparse graphs, Appl. Math. Lett., volume 7, number 1, pages 63–67, January 1994.
|
|
32
|
I. Krasikov and Y. Roditty.
More on vertex-switching reconstruction, J. Combin. Theory (Ser B), volume 60, number 1, pages 40–55, January 1994.
|
|
31
|
Y. Caro and Y. Roditty.
On decomposition of graphs into non-isomorphic independent sets, Ars Combinatoria, volume 35, pages 97–102, 1993.
|
|
30
|
Y. Roditty.
Packing and covering of the complete graph IV: The trees of order seven, Ars Combinatoria, volume 35, pages 33–64, 1993.
|
|
29
|
Y. Roditty.
On zero-sum Ramsey numbers of multiple copies of a graph., Ars Combinatoria, volume 35A, pages 89–95, 1993.
|
|
28
|
Y. Caro and Y. Roditty.
On zero-sum Turan numbers problems of Bialostocki and Dierker, J. Australian Math. Soc. (Ser A), volume 53, number 3, pages 402–407, 1992.
|
|
27
|
I. Krasikov and Y. Roditty.
Switching reconstruction and Diophantine equations, J. Combin. Theory (Ser B), volume 54, number 2, pages 189–195, March 1992.
|
|
26
|
Y. Caro, I. Krasikov and Y. Roditty.
On the largest subtree of given maximal degree in connected graphs, J. Graph Theory, volume 15, number 1, pages 7–13, March 1991.
|
|
25
|
A. Bialostocki, Y. Caro and Y. Roditty.
On zero-sum Turan numbers, Ars Combinatoria, volume 29A, pages 117–127, 1990.
|
|
24
|
Y. Caro and Y. Roditty.
Some results on $k$-factor of trees, Scientia (Ser A), volume 3, pages 1–4, 1990.
|
|
23
|
Y. Caro and Y. Roditty.
A note on packing trees into complete bipartite graphs and Fishburn’s Conjecture, Discrete Math., volume 82, pages 323–326, 1990.
|
|
22
|
Y. Caro and Y. Roditty.
A note on the $k$-domination number of a graph, Int. J. Math. and Math. Sci., volume 13, pages 205–206, 1990.
|
|
21
|
I. Krasikov and Y. Roditty.
Las-Vegnas type condition for trees, in R. Bodendick and R. Henn (eds.), Topics in Combinatorics and Graph Theory, pages 443–449, Physica-Verlag Heidelberg, 1990.
|
|
20
|
I. Krasikov and Y. Roditty.
Recent applications of the Nash-Williams’ Lemma to the edge-reconstruction conjecture, Ars Combinatoria, volume 29A, pages 215–224, 1990.
|
|
19
|
I. Krasikov and Y. Roditty.
Some applications of the Nash-Williams’ Lemma to the edge-reconstruction conjecture, Graph and Combinatorics, volume 6, pages 37–39, March 1990.
|
|
18
|
Y. Roditty.
Quick cancellation — An investigatory problem for high school students, Mathematics in School, volume 18, pages 28–29, 1989.
|
|
17
|
A. Alon, Y. Caro, I. Krasikov. and Y. Roditty.
Combinatorial reconstruction problems, J. Combin. Theory (Ser B ), volume 47, number 2, pages 153–161, October 1989.
|
|
16
|
I. Krasikov and Y. Roditty.
Counting technique in reconstruction problems, Ars Combinatoria, volume 25B, pages 133–140, 1988.
|
|
15
|
I. Krasikov and Y. Roditty.
Geometrical Reconstructions, Ars Combinatoria, volume 25B, pages 211– 219, 1988.
|
|
14
|
Y. Roditty.
Packing and covering of the complete graph III: On the tree packing conjecture, Scientia (Ser A), volume 1, pages 81–86, 1988.
|
|
13
|
A. Bialostocki and Y. Roditty.
A monotone path in an edge-odered graph, Int. J. Math. and Math. Sci., volume 10, pages 315–320, 1987.
|
|
12
|
C. D. Godsil, I. Krasikov and Y. Roditty.
Reconstructing graphs from their $k$-edge deleted subgraphs, J. Combin. Theory (Ser B), volume 43, number 3, pages 360–363, December 1987.
|
|
11
|
y I. Krasikov and Y. Roditty.
Balance equations for reconstruction problems, Archiv Der Mathematik, volume 48, pages 458–464, May 1987.
|
|
10
|
Y. Roditty.
Packing and covering of the complete graph I: The forests of order five, Int. J. Math. and Math. Sci., volume 9, pages 277–282, 1986.
|
|
9
|
Y. Caro, I. Krasikov and Y. Roditty.
Spanning trees and some edge-reconstructible graphs I., Ars Combinatoria, volume 20A, pages 109–118, 1985.
|
|
8
|
Y. Caro and Y. Roditty.
On the vertex-independence number and star decomposition of graphs, Ars Combinatoria, volume 20, pages 167–180, 1985.
|
|
7
|
I. Krasikov and Y. Roditty.
The edge reconstruction and reconstruction from vertex switching of graphs, Technical Report, School of Mathematical Sciences, Tel–Aviv University, 1985.
|
|
6
|
Y. Roditty.
Packing and covering of the complete graph II: The trees of order six, Ars Combinatoria, volume 19, pages 81–94, 1985.
|
|
5
|
Y. Roditty.
Packing and covering of the complete graph with a graph G of four vertices or less, J. Combin. Theory (Ser A), volume 34, pages 231–243, 1983.
|
|
4
|
Y. Roditty.
On Rolle’s theorem the mean-value theorems and applications, Int. J. Math. Edu. Sci. Technol., volume 5, pages 565–571, 1982.
|
|
3
|
A. Bialostocki and Y. Roditty.
$3K_2$-decomposition of a graph, Acta Math. Acad. Sci. Hungar., volume 40, pages 201–208, December 1982.
|
|
2
|
Y. Roditty.
On covering $K_{n+1}$ by $T_1, \dotsc,T_n$ special trees, Int. J. Math. Sci. Technol., volume 12, number 2, pages 139–142, 1981.
|
|
1
|
Y. Roditty.
Divisibility Tests, Math. Teaching, volume 91, 1980.
|
