 | 2012 |
|---|
| 58 |       | Yair Caro,
Michael A. Henning:
Directed domination in oriented graphs.
Discrete Applied Mathematics 160(7-8): 1053-1063 (2012) |
| 2011 |
|---|
| 57 | | Yair Caro,
Raphael Yuster:
Colorful monochromatic connectivity.
Discrete Mathematics 311(16): 1786-1792 (2011) |
| 56 | | Yair Caro,
Michael A. Henning:
A Greedy Partition Lemma for directed domination.
Discrete Optimization 8(3): 452-458 (2011) |
| 55 | | Yair Caro,
Douglas B. West,
Raphael Yuster:
Equitable Hypergraph Orientations.
Electr. J. Comb. 18(1): (2011) |
| 2010 |
|---|
| 54 | | Yair Caro,
Raphael Yuster:
Large induced subgraphs with equated maximum degree.
Discrete Mathematics 310(4): 742-747 (2010) |
| 2009 |
|---|
| 53 | | Yair Caro,
Douglas B. West:
Repetition Number of Graphs.
Electr. J. Comb. 16(1): (2009) |
| 52 | | Yair Caro,
Raphael Yuster:
Large disjoint subgraphs with the same order and size.
Eur. J. Comb. 30(4): 813-821 (2009) |
| 2008 |
|---|
| 51 | | Yair Caro,
Arieh Lev,
Yehuda Roditty,
Zsolt Tuza,
Raphael Yuster:
On Rainbow Connection.
Electr. J. Comb. 15(1): (2008) |
| 2007 |
|---|
| 50 | | Yair Caro,
Dieter Rautenbach:
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discrete Mathematics 307(6): 694-703 (2007) |
| 2005 |
|---|
| 49 | | Yair Caro,
William Klostermeyer,
Raphael Yuster:
Connected odd dominating sets in graphs.
Discussiones Mathematicae Graph Theory 25(3): 225-239 (2005) |
| 2004 |
|---|
| 48 |  | Yair Caro,
Yehuda Roditty:
Connected colorings of graphs.
Ars Comb. 70: (2004) |
| 47 | | Yair Caro,
Raphael Yuster:
Edge coloring complete uniform hypergraphs with many components.
J. Comb. Theory, Ser. B 91(2): 215-227 (2004) |
| 2003 |
|---|
| 46 | | Yair Caro,
Arieh Lev,
Yehuda Roditty:
Some results in step domination of graphs.
Ars Comb. 68: (2003) |
| 45 | | Yair Caro,
Raphael Yuster:
2-connected graphs with small 2-connected dominating sets.
Discrete Mathematics 269(1-3): 265-271 (2003) |
| 44 | | Yair Caro,
Raphael Yuster:
The Order of Monochromatic Subgraphs with a Given Minimum Degree.
Electr. J. Comb. 10: (2003) |
| 2002 |
|---|
| 43 | | Yair Caro,
Raphael Yuster:
List decomposition of graphs.
Discrete Mathematics 243(1-3): 67-77 (2002) |
| 42 | | 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) |
| 41 | | Paul Balister,
Yair Caro,
Cecil C. Rousseau,
Raphael Yuster:
Zero-sum Square Matrices.
Eur. J. Comb. 23(5): 489-497 (2002) |
| 2001 |
|---|
| 40 | | Yair Caro,
Cecil C. Rousseau:
Asymptotic Bounds for Bipartite Ramsey Numbers.
Electr. J. Comb. 8(1): (2001) |
| 39 | | Endre Boros,
Yair Caro,
Zoltán Füredi,
Raphael Yuster:
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B 82(2): 270-284 (2001) |
| 2000 |
|---|
| 38 | | Yair Caro,
Yehuda Roditty,
J. Schönheim:
Covering designs with minimum overlap.
Ars Comb. 55: (2000) |
| 37 | | Yair Caro,
Yehuda Roditty:
Improved bounds for the product of the domination and chromatic numbers of a graph.
Ars Comb. 56: (2000) |
| 36 | | Yair Caro,
Raphael Yuster:
Graphs with Large Variance.
Ars Comb. 57: (2000) |
| 35 | | Yair Caro,
Raphael Yuster:
Dominating A Family Of Graphs With Small Connected Subgraphs.
Combinatorics, Probability & Computing 9(4): 309-313 (2000) |
| 34 | | Yair Caro,
Yusheng Li,
Cecil C. Rousseau,
Yuming Zhang:
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers.
Discrete Mathematics 220(1-3): 51-56 (2000) |
| 33 | | Yair Caro,
Raphael Yuster:
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.
Electr. J. Comb. 7: (2000) |
| 32 | | Yair Caro,
Raphael Yuster:
Intersecting Designs.
J. Comb. Theory, Ser. A 89(1): 113-125 (2000) |
| 31 | | Yair Caro,
Douglas B. West,
Raphael Yuster:
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discrete Math. 13(2): 202-211 (2000) |
| 1999 |
|---|
| 30 | | Yair Caro,
Raphael Yuster:
Graphs Having the Local Decomposition Property.
Ars Comb. 52: (1999) |
| 29 | | Yair Caro,
Raphael Yuster:
The uniformity space of hypergraphs and its applications.
Discrete Mathematics 202(1-3): 1-19 (1999) |
| 28 | | Yair Caro,
Raphael Yuster:
Orthogonal Colorings of Graphs.
Electr. J. Comb. 6: (1999) |
| 27 | | Yair Caro,
Raphael Yuster:
Graph Decomposition of Slim Graphs.
Graphs and Combinatorics 15(1): 5-19 (1999) |
| 26 | | Yair Caro,
Raphael Yuster:
Orthogonal Decomposition and Packing of Complete Graphs.
J. Comb. Theory, Ser. A 88(1): 93-111 (1999) |
| 1998 |
|---|
| 25 | | Yair Caro:
On graphs determined by their k-subgraphs.
Ars Comb. 49: (1998) |
| 24 | | Yair Caro,
Raphael Yuster:
Covering Graphs: The Covering Problem Solved.
J. Comb. Theory, Ser. A 83(2): 273-282 (1998) |
| 23 | | Yair Caro,
Mark N. Ellingham,
J. E. Ramey:
Local Structure When All Maximal Independent Sets Have Equal Weight.
SIAM J. Discrete Math. 11(4): 644-654 (1998) |
| 1997 |
|---|
| 22 | | Yair Caro,
Yehuda Roditty,
J. Schönheim:
On colored designs - I.
Discrete Mathematics 164(1-3): 47-65 (1997) |
| 21 | | Yair Caro,
Raphael Yuster:
Efficient Covering Designs of the Complete Graph.
Electr. J. Comb. 4(1): (1997) |
| 20 | | Yair Caro,
Raphael Yuster:
Packing Graphs: The packing problem solved.
Electr. J. Comb. 4(1): (1997) |
| 19 | | Yair Caro:
Binomial Coefficients and Zero-Sum Ramsey Numbers.
J. Comb. Theory, Ser. A 80(2): 367-373 (1997) |
| 18 | | Noga Alon,
Yair Caro,
Raphael Yuster:
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
J. Comb. Theory, Ser. B 71(2): 144-161 (1997) |
| 17 | | Yair Caro,
Raphael Yuster:
Recognizing Global Occurrence of Local Properties.
J. Complexity 13(3): 340-352 (1997) |
| 1996 |
|---|
| 16 | | Yair Caro:
Simple proffs to three parity theorems.
Ars Comb. 42: (1996) |
| 15 | | Yair Caro:
Zero-sum problems - A survey.
Discrete Mathematics 152(1-3): 93-113 (1996) |
| 14 | | Yair Caro:
On the generalized Erdös-Szekeres Conjecture - a new upper bound.
Discrete Mathematics 160(1-3): 229-233 (1996) |
| 13 | | Yair Caro,
András Sebö,
Michael Tarsi:
Recognizing Greedy Structures.
J. Algorithms 20(1): 137-156 (1996) |
| 1995 |
|---|
| 12 | | Yair Caro,
Yehuda Roditty,
J. Schönheim:
On colored designs - II.
Discrete Mathematics 138(1-3): 177-186 (1995) |
| 1994 |
|---|
| 11 | | Yair Caro,
Ilia Krasikov,
Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees.
Discrete Mathematics 125(1-3): 101-106 (1994) |
| 10 | | Yair Caro:
On induced subgraphs with odd degrees.
Discrete Mathematics 132(1-3): 23-28 (1994) |
| 9 | | Yair Caro:
A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers.
J. Comb. Theory, Ser. A 68(1): 205-211 (1994) |
| 1993 |
|---|
| 8 | | Yair Caro,
Zsolt Tuza:
Bounded degrees and prescribed distances in graphs.
Discrete Mathematics 111(1-3): 87-93 (1993) |
| 7 | | Noga Alon,
Yair Caro,
Ilia Krasikov:
Bisection of trees and sequences.
Discrete Mathematics 114(1-3): 3-7 (1993) |
| 1992 |
|---|
| 6 | | Yair Caro:
On zero-sum Ramsey numbers - stars.
Discrete Mathematics 104(1): 1-6 (1992) |
| 1991 |
|---|
| 5 | | Yair Caro,
Zsolt Tuza:
Hypergraph coverings and local colorings.
J. Comb. Theory, Ser. B 52(1): 79-85 (1991) |
| 1990 |
|---|
| 4 | | Yair Caro,
Yehuda Roditty:
A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
Discrete Mathematics 82(3): 323-326 (1990) |
| 1989 |
|---|
| 3 | | Noga Alon,
Yair Caro,
Zsolt Tuza:
Sub-Ramsey numbers for arithmetic progressions.
Graphs and Combinatorics 5(1): 307-314 (1989) |
| 2 | | Noga Alon,
Yair Caro,
Ilia Krasikov,
Yehuda Roditty:
Combinatorial reconstruction problems.
J. Comb. Theory, Ser. B 47(2): 153-161 (1989) |
| 1981 |
|---|
| 1 | | Yair Caro,
J. Schönheim:
Generalized 1-factorization of trees.
Discrete Mathematics 33(3): 319-321 (1981) |
Data released under the ODC-BY 1.0 license — See also our legal information page