- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j69 |      | Yair Caro, Michael A. Henning: Directed domination in oriented graphs. Discrete Applied Mathematics 160(7-8): 1053-1063 (2012) |
| 2011 | ||
| j68 | | Yair Caro, Douglas B. West, Raphael Yuster: Equitable Hypergraph Orientations. Electr. J. Comb. 18(1) (2011) |
| j67 | | Yair Caro, Michael A. Henning: A Greedy Partition Lemma for directed domination. Discrete Optimization 8(3): 452-458 (2011) |
| j66 | | Yair Caro, Raphael Yuster: Colorful monochromatic connectivity. Discrete Mathematics 311(16): 1786-1792 (2011) |
| 2010 | ||
| j65 | | Yair Caro, Raphael Yuster: Large induced subgraphs with equated maximum degree. Discrete Mathematics 310(4): 742-747 (2010) |
| 2009 | ||
| j64 | | |
| j63 | | Yair Caro, Raphael Yuster: Large disjoint subgraphs with the same order and size. Eur. J. Comb. 30(4): 813-821 (2009) |
| 2008 | ||
| j62 | | Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster: On Rainbow Connection. Electr. J. Comb. 15(1) (2008) |
| 2007 | ||
| j61 | | Yair Caro, Dieter Rautenbach: Reconstructing graphs from size and degree properties of their induced k-subgraphs. Discrete Mathematics 307(6): 694-703 (2007) |
| 2005 | ||
| j60 | | Yair Caro, William Klostermeyer, Raphael Yuster: Connected odd dominating sets in graphs. Discussiones Mathematicae Graph Theory 25(3): 225-239 (2005) |
| 2004 | ||
| j59 |  | |
| j58 | | Yair Caro, Raphael Yuster: Edge coloring complete uniform hypergraphs with many components. J. Comb. Theory, Ser. B 91(2): 215-227 (2004) |
| 2003 | ||
| j57 | | Yair Caro, Arieh Lev, Yehuda Roditty: Some results in step domination of graphs. Ars Comb. 68 (2003) |
| j56 | | Yair Caro, Raphael Yuster: The Order of Monochromatic Subgraphs with a Given Minimum Degree. Electr. J. Comb. 10 (2003) |
| j55 | | Yair Caro, Raphael Yuster: 2-connected graphs with small 2-connected dominating sets. Discrete Mathematics 269(1-3): 265-271 (2003) |
| j54 | | Yair Caro, Michael S. Jacobson: On non-z(mod k) dominating sets. Discussiones Mathematicae Graph Theory 23(1): 189-199 (2003) |
| 2002 | ||
| j53 | | Yair Caro, Raphael Yuster: List decomposition of graphs. Discrete Mathematics 243(1-3): 67-77 (2002) |
| j52 | | 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) |
| j51 | | Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster: Zero-sum Square Matrices. Eur. J. Comb. 23(5): 489-497 (2002) |
| 2001 | ||
| j50 | | Yair Caro, Cecil C. Rousseau: Asymptotic Bounds for Bipartite Ramsey Numbers. Electr. J. Comb. 8(1) (2001) |
| j49 | | Yair Caro, John L. Goldwasser, William Klostermeyer: Odd and residue domination numbers of a graph. Discussiones Mathematicae Graph Theory 21(1): 119-136 (2001) |
| j48 | | 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 | ||
| j47 | | |
| j46 | | Yair Caro, Yehuda Roditty: Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000) |
| j45 | | |
| j44 | | Yair Caro, Raphael Yuster: A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. Electr. J. Comb. 7 (2000) |
| j43 | | Yair Caro, Raphael Yuster: Dominating A Family Of Graphs With Small Connected Subgraphs. Combinatorics, Probability & Computing 9(4): 309-313 (2000) |
| j42 | | 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) |
| j41 | | |
| j40 | | Yair Caro, Bert Hartnell: A characterization of Zm-well-covered graphs of girth 6 or more. Journal of Graph Theory 33(4): 246-255 (2000) |
| j39 | | 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 | ||
| j38 | | |
| j37 | | |
| j36 | | Yair Caro, Raphael Yuster: The uniformity space of hypergraphs and its applications. Discrete Mathematics 202(1-3): 1-19 (1999) |
| j35 | | Yair Caro, Raphael Yuster: Graph Decomposition of Slim Graphs. Graphs and Combinatorics 15(1): 5-19 (1999) |
| j34 | | Yair Caro, Raphael Yuster: Orthogonal Decomposition and Packing of Complete Graphs. J. Comb. Theory, Ser. A 88(1): 93-111 (1999) |
| j33 | | Yair Caro, Christian Provstgaard: Zero-sum delta-systems and multiple copies of graphs. Journal of Graph Theory 32(2): 207-216 (1999) |
| 1998 | ||
| j32 | | |
| j31 | | Yair Caro, Raphael Yuster: Covering Graphs: The Covering Problem Solved. J. Comb. Theory, Ser. A 83(2): 273-282 (1998) |
| j30 | | Yair Caro, Raphael Yuster: The characterization of zero-sum (mod 2) bipartite Ramsey numbers. Journal of Graph Theory 29(3): 151-166 (1998) |
| j29 | | 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 | ||
| j28 | | |
| j27 | | Yair Caro, Raphael Yuster: Efficient Covering Designs of the Complete Graph. Electr. J. Comb. 4(1) (1997) |
| j26 | | Yair Caro, Yehuda Roditty, J. Schönheim: On colored designs - I. Discrete Mathematics 164(1-3): 47-65 (1997) |
| j25 | | Yair Caro, Raphael Yuster: Recognizing Global Occurrence of Local Properties. J. Complexity 13(3): 340-352 (1997) |
| j24 | | 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) |
| j23 | | Yair Caro: Binomial Coefficients and Zero-Sum Ramsey Numbers. J. Comb. Theory, Ser. A 80(2): 367-373 (1997) |
| j22 | | Yair Caro: Subdivisions, parity and well-covered graphs. Journal of Graph Theory 25(1): 85-94 (1997) |
| 1996 | ||
| j21 | | |
| j20 | | |
| j19 | | Yair Caro: On the generalized Erdös-Szekeres Conjecture - a new upper bound. Discrete Mathematics 160(1-3): 229-233 (1996) |
| j18 | | Yair Caro, András Sebö, Michael Tarsi: Recognizing Greedy Structures. J. Algorithms 20(1): 137-156 (1996) |
| 1995 | ||
| j17 | | Yair Caro, Yehuda Roditty, J. Schönheim: On colored designs - II. Discrete Mathematics 138(1-3): 177-186 (1995) |
| 1994 | ||
| j16 | | Yair Caro, Ilia Krasikov, Yehuda Roditty: On induced subgraphs of trees, with restricted degrees. Discrete Mathematics 125(1-3): 101-106 (1994) |
| j15 | | |
| j14 | | Yair Caro: A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers. J. Comb. Theory, Ser. A 68(1): 205-211 (1994) |
| 1993 | ||
| j13 | | Yair Caro, Zsolt Tuza: Bounded degrees and prescribed distances in graphs. Discrete Mathematics 111(1-3): 87-93 (1993) |
| j12 | | Noga Alon, Yair Caro, Ilia Krasikov: Bisection of trees and sequences. Discrete Mathematics 114(1-3): 3-7 (1993) |
| j11 | | Noga Alon, Yair Caro: On three zero-sum Ramsey-type problems. Journal of Graph Theory 17(2): 177-192 (1993) |
| 1992 | ||
| j10 | | |
| j9 | | Yair Caro: On several variations of the turan and ramsey numbers. Journal of Graph Theory 16(3): 257-266 (1992) |
| 1991 | ||
| j8 | | Yair Caro, Zsolt Tuza: Hypergraph coverings and local colorings. J. Comb. Theory, Ser. B 52(1): 79-85 (1991) |
| j7 | | Yair Caro, Ilia Krasikov, Yehuda Roditty: On the largest tree of given maximum degree in a connected graph. Journal of Graph Theory 15(1): 7-13 (1991) |
| j6 | | Yair Caro, Zsolt Tuza: Improved lower bounds on k-independence. Journal of Graph Theory 15(1): 99-107 (1991) |
| j5 | | Yair Caro: On zero-sum delta-systems and multiple copies of hypergraphs. Journal of Graph Theory 15(5): 511-521 (1991) |
| 1990 | ||
| j4 | | 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 | ||
| j3 | | Noga Alon, Yair Caro, Zsolt Tuza: Sub-Ramsey numbers for arithmetic progressions. Graphs and Combinatorics 5(1): 307-314 (1989) |
| j2 | | Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty: Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47(2): 153-161 (1989) |
| 1981 | ||
| j1 | | Yair Caro, J. Schönheim: Generalized 1-factorization of trees. Discrete Mathematics 33(3): 319-321 (1981) |
Colors in the list of coauthors
Last update Mon May 20 09:46:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page