Generalized 1-factorization of trees. - Yair Caro; Johanan Schönheim (Discret. Math., 1981)

The decomposition of trees into subtrees. - Yair Caro (J. Graph Theory, 1984)

Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph. - Noga Alon; Yair Caro (Eur. J. Comb., 1986)

Extremal problems concerning transformations of the edges of the complete hypergraphs. - Yair Caro (J. Graph Theory, 1987)

Sub-Ramsey numbers for arithmetic progressions. - Noga Alon; Yair Caro; Zsolt Tuza (Graphs Comb., 1989)

Combinatorial reconstruction problems. - Noga Alon; Yair Caro; Ilia Krasikov; Yehuda Roditty (J. Comb. Theory B, 1989)

A note on packing trees into complete bipartite graphs and on fishburn's conjecture. - Yair Caro; Yehuda Roditty (Discret. Math., 1990)

Hypergraph coverings and local colorings. - Yair Caro; Zsolt Tuza (J. Comb. Theory B, 1991)

On zero-sum delta-systems and multiple copies of hypergraphs. - Yair Caro (J. Graph Theory, 1991)

On the largest tree of given maximum degree in a connected graph. - Yair Caro; Ilia Krasikov; Yehuda Roditty (J. Graph Theory, 1991)

Improved lower bounds on k-independence. - Yair Caro; Zsolt Tuza (J. Graph Theory, 1991)

On zero-sum Ramsey numbers - stars. - Yair Caro (Discret. Math., 1992)

On several variations of the turan and ramsey numbers. - Yair Caro (J. Graph Theory, 1992)

Bisection of trees and sequences. - Noga Alon; Yair Caro; Ilia Krasikov (Discret. Math., 1993)

Bounded degrees and prescribed distances in graphs. - Yair Caro; Zsolt Tuza (Discret. Math., 1993)

On three zero-sum Ramsey-type problems. - Noga Alon; Yair Caro (J. Graph Theory, 1993)

On induced subgraphs with odd degrees. - Yair Caro (Discret. Math., 1994)

On induced subgraphs of trees, with restricted degrees. - Yair Caro; Ilia Krasikov; Yehuda Roditty (Discret. Math., 1994)

A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers. - Yair Caro (J. Comb. Theory A, 1994)

Exact cuts and a simple proof of the zero graphs theorem. - Yair Caro (Ars Comb., 1995)

A zero-sum conjecture for trees. - Yair Caro; Yehuda Roditty (Ars Comb., 1995)

On colored designs - II. - Yair Caro; Yehuda Roditty; Johanan Schönheim (Discret. Math., 1995)

Simple proofs to three parity theorems. - Yair Caro (Ars Comb., 1996)

Zero-sum problems - A survey. - Yair Caro (Discret. Math., 1996)

On the generalized Erdös-Szekeres Conjecture - a new upper bound. - Yair Caro (Discret. Math., 1996)

Recognizing Greedy Structures. - Yair Caro; András Sebö; Michael Tarsi (J. Algorithms, 1996)

Packing Graphs: The packing problem solved. - Yair Caro; Raphael Yuster (Electron. J. Comb., 1997)

Efficient Covering Designs of the Complete Graph. - Yair Caro; Raphael Yuster (Electron. J. Comb., 1997)

On colored designs - I. - Yair Caro; Yehuda Roditty; Johanan Schönheim (Discret. Math., 1997)

Recognizing Global Occurrence of Local Properties. - Yair Caro; Raphael Yuster (J. Complex., 1997)

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. - Noga Alon; Yair Caro; Raphael Yuster (J. Comb. Theory B, 1997)

Binomial Coefficients and Zero-Sum Ramsey Numbers. - Yair Caro (J. Comb. Theory A, 1997)

Subdivisions, parity and well-covered graphs. - Yair Caro (J. Graph Theory, 1997)

On graphs determined by their k-subgraphs. - Yair Caro (Ars Comb., 1998)

Covering Graphs: The Covering Problem Solved. - Yair Caro; Raphael Yuster (J. Comb. Theory A, 1998)

The characterization of zero-sum (mod 2) bipartite Ramsey numbers. - Yair Caro; Raphael Yuster (J. Graph Theory, 1998)

Local Structure When All Maximal Independent Sets Have Equal Weight. - Yair Caro; Mark N. Ellingham; J. E. Ramey (SIAM J. Discret. Math., 1998)

Graphs Having the Local Decomposition Property. - Yair Caro; Raphael Yuster (Ars Comb., 1999)

Orthogonal Colorings of Graphs. - Yair Caro; Raphael Yuster (Electron. J. Comb., 1999)

The uniformity space of hypergraphs and its applications. - Yair Caro; Raphael Yuster (Discret. Math., 1999)

Graph Decomposition of Slim Graphs. - Yair Caro; Raphael Yuster (Graphs Comb., 1999)

Orthogonal Decomposition and Packing of Complete Graphs. - Yair Caro; Raphael Yuster (J. Comb. Theory A, 1999)

Zero-sum delta-systems and multiple copies of graphs. - Yair Caro; Christian Provstgaard (J. Graph Theory, 1999)

Improved bounds for the product of the domination and chromatic numbers of a graph. - Yair Caro; Yehuda Roditty (Ars Comb., 2000)

Covering designs with minimum overlap. - Yair Caro; Yehuda Roditty; Johanan Schönheim (Ars Comb., 2000)

Graphs with Large Variance. - Yair Caro; Raphael Yuster (Ars Comb., 2000)

A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. - Yair Caro; Raphael Yuster (Electron. J. Comb., 2000)

Dominating A Family Of Graphs With Small Connected Subgraphs. - Yair Caro; Raphael Yuster (Comb. Probab. Comput., 2000)

Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers. - Yair Caro; Yusheng Li 001; Cecil C. Rousseau; Yuming Zhang (Discret. Math., 2000)

Intersecting Designs. - Yair Caro; Raphael Yuster (J. Comb. Theory A, 2000)

A characterization of Zm-well-covered graphs of girth 6 or more. - Yair Caro; Bert L. Hartnell (J. Graph Theory, 2000)

Connected Domination and Spanning Trees with Many Leaves. - Yair Caro; Douglas B. West; Raphael Yuster (SIAM J. Discret. Math., 2000)

Asymptotic Bounds for Bipartite Ramsey Numbers. - Yair Caro; Cecil C. Rousseau (Electron. J. Comb., 2001)

Odd and residue domination numbers of a graph. - Yair Caro; John L. Goldwasser; William Klostermeyer (Discuss. Math. Graph Theory, 2001)

Covering Non-uniform Hypergraphs. - Endre Boros; Yair Caro; Zoltán Füredi; Raphael Yuster (J. Comb. Theory B, 2001)

On colored designs-III: on lambda-colored H-designs, H having lambda edges. - Yair Caro; Yehuda Roditty; Johanan Schönheim (Discret. Math., 2002)

List decomposition of graphs. - Yair Caro; Raphael Yuster (Discret. Math., 2002)

Zero-sum Square Matrices. - Paul Balister; Yair Caro; Cecil C. Rousseau; Raphael Yuster (Eur. J. Comb., 2002)

Some results in step domination of graphs. - Yair Caro; Arieh Lev; Yehuda Roditty (Ars Comb., 2003)

The Order of Monochromatic Subgraphs with a Given Minimum Degree. - Yair Caro; Raphael Yuster (Electron. J. Comb., 2003)

2-connected graphs with small 2-connected dominating sets. - Yair Caro; Raphael Yuster (Discret. Math., 2003)

On non-z(mod k) dominating sets. - Yair Caro; Michael S. Jacobson (Discuss. Math. Graph Theory, 2003)

Connected colorings of graphs. - Yair Caro; Yehuda Roditty (Ars Comb., 2004)

Edge coloring complete uniform hypergraphs with many components. - Yair Caro; Raphael Yuster (J. Comb. Theory B, 2004)

Connected odd dominating sets in graphs. - Yair Caro; William Klostermeyer; Raphael Yuster (Discuss. Math. Graph Theory, 2005)

Reconstructing graphs from size and degree properties of their induced k-subgraphs. - Yair Caro; Dieter Rautenbach (Discret. Math., 2007)

On Rainbow Connection. - Yair Caro; Arieh Lev; Yehuda Roditty; Zsolt Tuza; Raphael Yuster (Electron. J. Comb., 2008)

Repetition Number of Graphs. - Yair Caro; Douglas B. West (Electron. J. Comb., 2009)

Large disjoint subgraphs with the same order and size. - Yair Caro; Raphael Yuster (Eur. J. Comb., 2009)

Large induced subgraphs with equated maximum degree. - Yair Caro; Raphael Yuster (Discret. Math., 2010)

Equitable Hypergraph Orientations. - Yair Caro; Douglas B. West; Raphael Yuster (Electron. J. Comb., 2011)

A Greedy Partition Lemma for directed domination. - Yair Caro; Michael A. Henning (Discret. Optim., 2011)

Colorful monochromatic connectivity. - Yair Caro; Raphael Yuster (Discret. Math., 2011)

Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number. - Yair Caro; Adriana Hansberg (Electron. J. Comb., 2012)

Directed domination in oriented graphs. - Yair Caro; Michael A. Henning (Discret. Appl. Math., 2012)

Fair domination in graphs. - Yair Caro; Adriana Hansberg; Michael A. Henning (Discret. Math., 2012)

New Approach to the k-Independence Number of a Graph. - Yair Caro; Adriana Hansberg (Electron. J. Comb., 2013)

Partitions of graphs into small and large sets. - Asen Bojilov; Yair Caro; Adriana Hansberg; Nedyalko Nenov (Discret. Appl. Math., 2013)

Degree sequence index strategy. - Yair Caro; Ryan Pepper (Australas. J Comb., 2014)

Forcing $k$-repetitions in Degree Sequences. - Yair Caro; Asaf Shapira; Raphael Yuster (Electron. J. Comb., 2014)

Non-monochromatic non-rainbow colourings of σ-hypergraphs. - Yair Caro; Josef Lauri (Discret. Math., 2014)

Simultaneous Domination in Graphs. - Yair Caro; Michael A. Henning (Graphs Comb., 2014)

Independence and matchings in σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Australas. J Comb., 2015)

Barycentric and zero-sum Ramsey numbers. - Yair Caro; Leida Gonzalez; Luz Elimar Marchan; Oscar Ordaz (Ars Comb., 2015)

Upper bounds on the k-forcing number of a graph. - David Amos; Yair Caro; Randy Davila; Ryan Pepper (Discret. Appl. Math., 2015)

(2, 2)-colourings and clique-free σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Appl. Math., 2015)

Constrained colouring and σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2015)

The saturation number for the length of degree monotone paths. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2015)

Isolation in graphs. - Adriana Hansberg; Yair Caro (Electron. Notes Discret. Math., 2015)

Regular independent sets. - Yair Caro; Adriana Hansberg; Ryan Pepper (Discret. Appl. Math., 2016)

Selective hypergraph colourings. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Math., 2016)

On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. - Yair Caro; Raphael Yuster (Graphs Comb., 2016)

Ramsey numbers for degree monotone paths. - Yair Caro; Raphael Yuster; Christina Zarb (Discret. Math., 2017)

The Effect of Local Majority on Global Majorityin Connected Graphs. - Yair Caro; Raphael Yuster (Graphs Comb., 2018)

Notes on spreads of degrees in graphs. - Yair Caro; Josef Lauri; Christina Zarb (Bull. ICA, 2019)

Irregular independence and irregular domination. - Peter Borg; Yair Caro; Kurt Fenech (Discret. Appl. Math., 2019)

Extremal k-forcing sets in oriented graphs. - Yair Caro; Randy Davila; Ryan Pepper (Discret. Appl. Math., 2019)

Zero-Sum Km Over Z and the Story of K4. - Yair Caro; Adriana Hansberg; Amanda Montejano (Graphs Comb., 2019)

Zero-sum subsequences in bounded-sum {-1, 1}-sequences. - Yair Caro; Adriana Hansberg; Amanda Montejano (J. Comb. Theory A, 2019)

Regular Turán numbers. - Yair Caro; Zsolt Tuza (Australas. J Comb., 2020)

A note on totally-omnitonal graphs. - Yair Caro; Josef Lauri; Christina Zarb (Bull. ICA, 2020)

Induced subgraphs with many repeated degrees. - Yair Caro; Raphael Yuster (Discret. Math., 2020)

Recursive constructions of amoebas. - Adriana Hansberg; Amanda Montejano; Yair Caro (LAGOS, 2021)

Unavoidable chromatic patterns in 2-colorings of the complete graph. - Yair Caro; Adriana Hansberg; Amanda Montejano (J. Graph Theory, 2021)

On Zero-Sum Spanning Trees and Zero-Sum Connectivity. - Yair Caro; Adriana Hansberg; Josef Lauri; Christina Zarb (Electron. J. Comb., 2022)

Remarks on odd colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski (Discret. Appl. Math., 2022)

Index of parameters of iterated line graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Math., 2022)

New results relating inependence and matchings. - Yair Caro; Randy Davila; Ryan Pepper (Discuss. Math. Graph Theory, 2022)

On small balanceable, strongly-balanceable and omnitonal graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2022)

Graphs with constant balancing number. - Yair Caro; Ileana González-Escalante; Adriana Hansberg; Mariel Jácome; Tonatiuh Matos Wiederhold; Amanda Montejano (LAGOS, 2023)

Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas. - Yair Caro; Adriana Hansberg; Amanda Montejano (Electron. J. Comb., 2023)

The feasibility problem for line graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Appl. Math., 2023)

Remarks on proper conflict-free colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski (Discret. Math., 2023)

Sum-distinguishing number of sparse hypergraphs. - Maria Axenovich; Yair Caro; Raphael Yuster (Eur. J. Comb., 2023)

Connected Turán number of trees. - Yair Caro; Balázs Patkós; Zsolt Tuza (Ars Math. Contemp., 2024)

Counting connected partitions of graphs. - Yair Caro; Balázs Patkós; Zsolt Tuza; Máté Vizer (J. Graph Theory, 2024)

Flip colouring of graphs. - Yair Caro; Josef Lauri; Xandru Mifsud; Raphael Yuster; Christina Zarb (Graphs Comb., 2024)

Comparing the p-independence number of regular graphs to the q-independence number of their line graphs. - Yair Caro; Randy Davila; Ryan Pepper (Discret. Appl. Math., 2025)

Monochromatic graph decompositions inspired by anti-Ramsey colorings. - Yair Caro; Zsolt Tuza (Discret. Appl. Math., 2025)

On strong odd colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski; Zsolt Tuza (Discret. Math., 2025)

On (r, c)-constant, planar and circulant graphs. - Yair Caro; Xandru Mifsud (Discuss. Math. Graph Theory, 2025)

Edge mappings of graphs: Turán type parameters. - Yair Caro; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2025)