Yair Caro

124 papers C 2Journal 122
YearRankTypeTitle / Venue / Authors
2026 J jnl
Results on three problems on isolation of graphs.
CoRR
Peter Borg, Yair Caro
2026 J jnl
The evolution of unavoidable bichromatic patterns and extremal cases of balanceability.
Discret. Math.
Yair Caro, Adriana Hansberg, Amanda Montejano
2025 J jnl
Comparing the p-independence number of regular graphs to the q-independence number of their line graphs.
Discret. Appl. Math.
Yair Caro, Randy Davila, Ryan Pepper
2025 J jnl
Edge mappings of graphs: Turán type parameters.
Eur. J. Comb.
Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2025 J jnl
Monochromatic graph decompositions inspired by anti-Ramsey colorings.
Discret. Appl. Math.
Yair Caro, Zsolt Tuza
2025 J jnl
On
Discuss. Math. Graph Theory
Yair Caro, Xandru Mifsud
2025 J jnl
On strong odd colorings of graphs.
Discret. Math.
Yair Caro, Mirko Petrusevski, Riste Skrekovski, Zsolt Tuza
2024 J jnl
Connected Turán number of trees.
Ars Math. Contemp.
Yair Caro, Balázs Patkós, Zsolt Tuza
2024 J jnl
Counting connected partitions of graphs.
J. Graph Theory
Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Flip colouring of graphs.
Graphs Comb.
Yair Caro, Josef Lauri, Xandru Mifsud, Raphael Yuster, Christina Zarb
2023 J jnl
Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas.
Electron. J. Comb.
Yair Caro, Adriana Hansberg, Amanda Montejano
2023 C conf
Graphs with constant balancing number.
LAGOS
Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano
2023 J jnl
Remarks on proper conflict-free colorings of graphs.
Discret. Math.
Yair Caro, Mirko Petrusevski, Riste Skrekovski
2023 J jnl
Sum-distinguishing number of sparse hypergraphs.
Eur. J. Comb.
Maria Axenovich, Yair Caro, Raphael Yuster
2023 J jnl
The feasibility problem for line graphs.
Discret. Appl. Math.
Yair Caro, Josef Lauri, Christina Zarb
2022 J jnl
Index of parameters of iterated line graphs.
Discret. Math.
Yair Caro, Josef Lauri, Christina Zarb
2022 J jnl
New results relating inependence and matchings.
Discuss. Math. Graph Theory
Yair Caro, Randy Davila, Ryan Pepper
2022 J jnl
On Zero-Sum Spanning Trees and Zero-Sum Connectivity.
Electron. J. Comb.
Yair Caro, Adriana Hansberg, Josef Lauri, Christina Zarb
2022 J jnl
On small balanceable, strongly-balanceable and omnitonal graphs.
Discuss. Math. Graph Theory
Yair Caro, Josef Lauri, Christina Zarb
2022 J jnl
Remarks on odd colorings of graphs.
Discret. Appl. Math.
Yair Caro, Mirko Petrusevski, Riste Skrekovski
2021 C conf
Recursive constructions of amoebas.
LAGOS
Adriana Hansberg, Amanda Montejano, Yair Caro
2021 J jnl
Unavoidable chromatic patterns in 2-colorings of the complete graph.
J. Graph Theory
Yair Caro, Adriana Hansberg, Amanda Montejano
2020 J jnl
A note on totally-omnitonal graphs.
Bull. ICA
Yair Caro, Josef Lauri, Christina Zarb
2020 J jnl
Induced subgraphs with many repeated degrees.
Discret. Math.
Yair Caro, Raphael Yuster
2020 J jnl
Regular Turán numbers.
Australas. J Comb.
Yair Caro, Zsolt Tuza
2019 J jnl
Extremal k-forcing sets in oriented graphs.
Discret. Appl. Math.
Yair Caro, Randy Davila, Ryan Pepper
2019 J jnl
Irregular independence and irregular domination.
Discret. Appl. Math.
Peter Borg, Yair Caro, Kurt Fenech
2019 J jnl
Notes on spreads of degrees in graphs.
Bull. ICA
Yair Caro, Josef Lauri, Christina Zarb
2019 J jnl
Zero-Sum K
Graphs Comb.
Yair Caro, Adriana Hansberg, Amanda Montejano
2019 J jnl
Zero-sum subsequences in bounded-sum {-1, 1}-sequences.
J. Comb. Theory A
Yair Caro, Adriana Hansberg, Amanda Montejano
2018 J jnl
The Effect of Local Majority on Global Majorityin Connected Graphs.
Graphs Comb.
Yair Caro, Raphael Yuster
2017 J jnl
Ramsey numbers for degree monotone paths.
Discret. Math.
Yair Caro, Raphael Yuster, Christina Zarb
2016 J jnl
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ.
Graphs Comb.
Yair Caro, Raphael Yuster
2016 J jnl
Regular independent sets.
Discret. Appl. Math.
Yair Caro, Adriana Hansberg, Ryan Pepper
2016 J jnl
Selective hypergraph colourings.
Discret. Math.
Yair Caro, Josef Lauri, Christina Zarb
2015 J jnl
(2, 2)-colourings and clique-free σ-hypergraphs.
Discret. Appl. Math.
Yair Caro, Josef Lauri, Christina Zarb
2015 J jnl
Barycentric and zero-sum Ramsey numbers.
Ars Comb.
Yair Caro, Leida Gonzalez, Luz Elimar Marchan, Oscar Ordaz
2015 J jnl
Constrained colouring and σ-hypergraphs.
Discuss. Math. Graph Theory
Yair Caro, Josef Lauri, Christina Zarb
2015 J jnl
Independence and matchings in σ-hypergraphs.
Australas. J Comb.
Yair Caro, Josef Lauri, Christina Zarb
2015 J jnl
Isolation in graphs.
Electron. Notes Discret. Math.
Adriana Hansberg, Yair Caro
2015 J jnl
The saturation number for the length of degree monotone paths.
Discuss. Math. Graph Theory
Yair Caro, Josef Lauri, Christina Zarb
2015 J jnl
Upper bounds on the k-forcing number of a graph.
Discret. Appl. Math.
David Amos, Yair Caro, Randy Davila, Ryan Pepper
2014 J jnl
Degree sequence index strategy.
Australas. J Comb.
Yair Caro, Ryan Pepper
2014 J jnl
Forcing $k$-repetitions in Degree Sequences.
Electron. J. Comb.
Yair Caro, Asaf Shapira, Raphael Yuster
2014 J jnl
Non-monochromatic non-rainbow colourings of σ-hypergraphs.
Discret. Math.
Yair Caro, Josef Lauri
2014 J jnl
Simultaneous Domination in Graphs.
Graphs Comb.
Yair Caro, Michael A. Henning
2013 J jnl
New Approach to the k-Independence Number of a Graph.
Electron. J. Comb.
Yair Caro, Adriana Hansberg
2013 J jnl
Partitions of graphs into small and large sets.
Discret. Appl. Math.
Asen Bojilov, Yair Caro, Adriana Hansberg, Nedyalko Nenov
2012 J jnl
Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number.
Electron. J. Comb.
Yair Caro, Adriana Hansberg
2012 J jnl
Directed domination in oriented graphs.
Discret. Appl. Math.
Yair Caro, Michael A. Henning
2012 J jnl
Fair domination in graphs.
Discret. Math.
Yair Caro, Adriana Hansberg, Michael A. Henning
2011 J jnl
A Greedy Partition Lemma for directed domination.
Discret. Optim.
Yair Caro, Michael A. Henning
2011 J jnl
Colorful monochromatic connectivity.
Discret. Math.
Yair Caro, Raphael Yuster
2011 J jnl
Equitable Hypergraph Orientations.
Electron. J. Comb.
Yair Caro, Douglas B. West, Raphael Yuster
2010 J jnl
Large induced subgraphs with equated maximum degree.
Discret. Math.
Yair Caro, Raphael Yuster
2009 J jnl
Large disjoint subgraphs with the same order and size.
Eur. J. Comb.
Yair Caro, Raphael Yuster
2009 J jnl
Repetition Number of Graphs.
Electron. J. Comb.
Yair Caro, Douglas B. West
2008 J jnl
On Rainbow Connection.
Electron. J. Comb.
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
2007 J jnl
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discret. Math.
Yair Caro, Dieter Rautenbach
2005 J jnl
Connected odd dominating sets in graphs.
Discuss. Math. Graph Theory
Yair Caro, William Klostermeyer, Raphael Yuster
2004 J jnl
Connected colorings of graphs.
Ars Comb.
Yair Caro, Yehuda Roditty
2004 J jnl
Edge coloring complete uniform hypergraphs with many components.
J. Comb. Theory B
Yair Caro, Raphael Yuster
2003 J jnl
2-connected graphs with small 2-connected dominating sets.
Discret. Math.
Yair Caro, Raphael Yuster
2003 J jnl
On non-z(mod k) dominating sets.
Discuss. Math. Graph Theory
Yair Caro, Michael S. Jacobson
2003 J jnl
Some results in step domination of graphs.
Ars Comb.
Yair Caro, Arieh Lev, Yehuda Roditty
2003 J jnl
The Order of Monochromatic Subgraphs with a Given Minimum Degree.
Electron. J. Comb.
Yair Caro, Raphael Yuster
2002 J jnl
List decomposition of graphs.
Discret. Math.
Yair Caro, Raphael Yuster
2002 J jnl
On colored designs-III: on lambda-colored
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
2002 J jnl
Zero-sum Square Matrices.
Eur. J. Comb.
Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
2001 J jnl
Asymptotic Bounds for Bipartite Ramsey Numbers.
Electron. J. Comb.
Yair Caro, Cecil C. Rousseau
2001 J jnl
Covering Non-uniform Hypergraphs.
J. Comb. Theory B
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
2001 J jnl
Odd and residue domination numbers of a graph.
Discuss. Math. Graph Theory
Yair Caro, John L. Goldwasser, William Klostermeyer
2000 J jnl
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.
Electron. J. Comb.
Yair Caro, Raphael Yuster
2000 J jnl
A characterization of Z
J. Graph Theory
Yair Caro, Bert L. Hartnell
2000 J jnl
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers.
Discret. Math.
Yair Caro, Yusheng Li, Cecil C. Rousseau, Yuming Zhang
2000 J jnl
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discret. Math.
Yair Caro, Douglas B. West, Raphael Yuster
2000 J jnl
Covering designs with minimum overlap.
Ars Comb.
Yair Caro, Yehuda Roditty, Johanan Schönheim
2000 J jnl
Dominating A Family Of Graphs With Small Connected Subgraphs.
Comb. Probab. Comput.
Yair Caro, Raphael Yuster
2000 J jnl
Graphs with Large Variance.
Ars Comb.
Yair Caro, Raphael Yuster
2000 J jnl
Improved bounds for the product of the domination and chromatic numbers of a graph.
Ars Comb.
Yair Caro, Yehuda Roditty
2000 J jnl
Intersecting Designs.
J. Comb. Theory A
Yair Caro, Raphael Yuster
1999 J jnl
Graph Decomposition of Slim Graphs.
Graphs Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Graphs Having the Local Decomposition Property.
Ars Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Orthogonal Colorings of Graphs.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Orthogonal Decomposition and Packing of Complete Graphs.
J. Comb. Theory A
Yair Caro, Raphael Yuster
1999 J jnl
The uniformity space of hypergraphs and its applications.
Discret. Math.
Yair Caro, Raphael Yuster
1999 J jnl
Zero-sum delta-systems and multiple copies of graphs.
J. Graph Theory
Yair Caro, Christian Provstgaard
1998 J jnl
Covering Graphs: The Covering Problem Solved.
J. Comb. Theory A
Yair Caro, Raphael Yuster
1998 J jnl
Local Structure When All Maximal Independent Sets Have Equal Weight.
SIAM J. Discret. Math.
Yair Caro, Mark N. Ellingham, J. E. Ramey
1998 J jnl
On graphs determined by their k-subgraphs.
Ars Comb.
Yair Caro
1998 J jnl
The characterization of zero-sum (mod 2) bipartite Ramsey numbers.
J. Graph Theory
Yair Caro, Raphael Yuster
1997 J jnl
Binomial Coefficients and Zero-Sum Ramsey Numbers.
J. Comb. Theory A
Yair Caro
1997 J jnl
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
J. Comb. Theory B
Noga Alon, Yair Caro, Raphael Yuster
1997 J jnl
Efficient Covering Designs of the Complete Graph.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1997 J jnl
On colored designs - I.
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
1997 J jnl
Packing Graphs: The packing problem solved.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1997 J jnl
Recognizing Global Occurrence of Local Properties.
J. Complex.
Yair Caro, Raphael Yuster
1997 J jnl
Subdivisions, parity and well-covered graphs.
J. Graph Theory
Yair Caro
1996 J jnl
On the generalized Erdös-Szekeres Conjecture - a new upper bound.
Discret. Math.
Yair Caro
1996 J jnl
Recognizing Greedy Structures.
J. Algorithms
Yair Caro, András Sebö, Michael Tarsi
1996 J jnl
Simple proofs to three parity theorems.
Ars Comb.
Yair Caro
1996 J jnl
Zero-sum problems - A survey.
Discret. Math.
Yair Caro
1995 J jnl
A zero-sum conjecture for trees.
Ars Comb.
Yair Caro, Yehuda Roditty
1995 J jnl
Exact cuts and a simple proof of the zero graphs theorem.
Ars Comb.
Yair Caro
1995 J jnl
On colored designs - II.
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
1994 J jnl
A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers.
J. Comb. Theory A
Yair Caro
1994 J jnl
On induced subgraphs of trees, with restricted degrees.
Discret. Math.
Yair Caro, Ilia Krasikov, Yehuda Roditty
1994 J jnl
On induced subgraphs with odd degrees.
Discret. Math.
Yair Caro
1993 J jnl
Bisection of trees and sequences.
Discret. Math.
Noga Alon, Yair Caro, Ilia Krasikov
1993 J jnl
Bounded degrees and prescribed distances in graphs.
Discret. Math.
Yair Caro, Zsolt Tuza
1993 J jnl
On three zero-sum Ramsey-type problems.
J. Graph Theory
Noga Alon, Yair Caro
1992 J jnl
On several variations of the turan and ramsey numbers.
J. Graph Theory
Yair Caro
1992 J jnl
On zero-sum Ramsey numbers - stars.
Discret. Math.
Yair Caro
1991 J jnl
Hypergraph coverings and local colorings.
J. Comb. Theory B
Yair Caro, Zsolt Tuza
1991 J jnl
Improved lower bounds on
J. Graph Theory
Yair Caro, Zsolt Tuza
1991 J jnl
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory
Yair Caro, Ilia Krasikov, Yehuda Roditty
1991 J jnl
On zero-sum delta-systems and multiple copies of hypergraphs.
J. Graph Theory
Yair Caro
1990 J jnl
A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
Discret. Math.
Yair Caro, Yehuda Roditty
1989 J jnl
Combinatorial reconstruction problems.
J. Comb. Theory B
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
1989 J jnl
Sub-Ramsey numbers for arithmetic progressions.
Graphs Comb.
Noga Alon, Yair Caro, Zsolt Tuza
1987 J jnl
Extremal problems concerning transformations of the edges of the complete hypergraphs.
J. Graph Theory
Yair Caro
1986 J jnl
Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph.
Eur. J. Comb.
Noga Alon, Yair Caro
1984 J jnl
The decomposition of trees into subtrees.
J. Graph Theory
Yair Caro
1981 J jnl
Generalized 1-factorization of trees.
Discret. Math.
Yair Caro, Johanan Schönheim