Yair Caro

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 25

Top Venues

Discret. Appl. Math.

Discret. Math.

Graphs Comb.

Discuss. Math. Graph Theory

Publications

Yair Caro, Mirko Petrusevski, Riste Skrekovski
Remarks on proper conflict-free colorings of graphs. Discret. Math. 346 (2) (2023)
Maria Axenovich, Yair Caro, Raphael Yuster
Sum-distinguishing number of sparse hypergraphs. Eur. J. Comb. 112 (2023)
Yair Caro, Josef Lauri, Christina Zarb
The feasibility problem for line graphs. Discret. Appl. Math. 324 (2023)
Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano
Graphs with constant balancing number. LAGOS (2023)
Yair Caro, Adriana Hansberg, Amanda Montejano
Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas. Electron. J. Comb. 30 (3) (2023)
Yair Caro, Adriana Hansberg, Josef Lauri, Christina Zarb
On Zero-Sum Spanning Trees and Zero-Sum Connectivity. Electron. J. Comb. 29 (1) (2022)
Yair Caro, Mirko Petrusevski, Riste Skrekovski
Remarks on odd colorings of graphs. Discret. Appl. Math. 321 (2022)
Yair Caro, Josef Lauri, Christina Zarb
On small balanceable, strongly-balanceable and omnitonal graphs. Discuss. Math. Graph Theory 42 (4) (2022)
Yair Caro, Josef Lauri, Christina Zarb
Index of parameters of iterated line graphs. Discret. Math. 345 (8) (2022)
Yair Caro, Randy Davila, Ryan Pepper
New results relating inependence and matchings. Discuss. Math. Graph Theory 42 (3) (2022)
Yair Caro, Adriana Hansberg, Amanda Montejano
Unavoidable chromatic patterns in 2-colorings of the complete graph. J. Graph Theory 97 (1) (2021)
Adriana Hansberg, Amanda Montejano, Yair Caro
Recursive constructions of amoebas. LAGOS (2021)
Yair Caro, Zsolt Tuza
Regular Turán numbers. Australas. J Comb. 78 (2020)
Yair Caro, Raphael Yuster
Induced subgraphs with many repeated degrees. Discret. Math. 343 (5) (2020)
Yair Caro, Josef Lauri, Christina Zarb
A note on totally-omnitonal graphs. Bull. ICA 89 (2020)
Yair Caro, Adriana Hansberg, Amanda Montejano
Zero-sum subsequences in bounded-sum {-1, 1}-sequences. J. Comb. Theory, Ser. A 161 (2019)
Peter Borg, Yair Caro, Kurt Fenech
Irregular independence and irregular domination. Discret. Appl. Math. 266 (2019)
Yair Caro, Randy Davila, Ryan Pepper
Extremal k-forcing sets in oriented graphs. Discret. Appl. Math. 262 (2019)
Yair Caro, Adriana Hansberg, Amanda Montejano
. Graphs Comb. 35 (4) (2019)
Yair Caro, Josef Lauri, Christina Zarb
Notes on spreads of degrees in graphs. Bull. ICA 85 (2019)
Yair Caro, Raphael Yuster
The Effect of Local Majority on Global Majorityin Connected Graphs. Graphs Comb. 34 (6) (2018)
Yair Caro, Raphael Yuster, Christina Zarb
Ramsey numbers for degree monotone paths. Discret. Math. 340 (2) (2017)
Yair Caro, Adriana Hansberg, Ryan Pepper
Regular independent sets. Discret. Appl. Math. 203 (2016)
Yair Caro, Raphael Yuster
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. Graphs Comb. 32 (1) (2016)
Yair Caro, Josef Lauri, Christina Zarb
Selective hypergraph colourings. Discret. Math. 339 (4) (2016)
Yair Caro, Leida Gonzalez, Luz Elimar Marchan, Oscar Ordaz
Barycentric and zero-sum Ramsey numbers. Ars Comb. 123 (2015)
Yair Caro, Josef Lauri, Christina Zarb
Constrained colouring and σ-hypergraphs. Discuss. Math. Graph Theory 35 (1) (2015)
Yair Caro, Josef Lauri, Christina Zarb
Independence and matchings in σ-hypergraphs. Australas. J Comb. 63 (2015)
Yair Caro, Josef Lauri, Christina Zarb
(2, 2)-colourings and clique-free σ-hypergraphs. Discret. Appl. Math. 185 (2015)
David Amos, Yair Caro, Randy Davila, Ryan Pepper
Upper bounds on the k-forcing number of a graph. Discret. Appl. Math. 181 (2015)
Yair Caro, Josef Lauri, Christina Zarb
The saturation number for the length of degree monotone paths. Discuss. Math. Graph Theory 35 (3) (2015)
Adriana Hansberg, Yair Caro
Isolation in graphs. Electron. Notes Discret. Math. 50 (2015)
Yair Caro, Michael A. Henning
Simultaneous Domination in Graphs. Graphs Comb. 30 (6) (2014)
Yair Caro, Josef Lauri
Non-monochromatic non-rainbow colourings of σ-hypergraphs. Discret. Math. 318 (2014)
Yair Caro, Asaf Shapira, Raphael Yuster
Forcing $k$-repetitions in Degree Sequences. Electron. J. Comb. 21 (1) (2014)
Yair Caro, Ryan Pepper
Degree sequence index strategy. Australas. J Comb. 59 (2014)
Yair Caro, Adriana Hansberg
New Approach to the k-Independence Number of a Graph. Electron. J. Comb. 20 (1) (2013)
Asen Bojilov, Yair Caro, Adriana Hansberg, Nedyalko Nenov
Partitions of graphs into small and large sets. Discret. Appl. Math. 161 (13-14) (2013)
Yair Caro, Michael A. Henning
Directed domination in oriented graphs. Discret. Appl. Math. 160 (7-8) (2012)
Yair Caro, Adriana Hansberg, Michael A. Henning
Fair domination in graphs. Discret. Math. 312 (19) (2012)
Yair Caro, Adriana Hansberg
Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number. Electron. J. Comb. 19 (3) (2012)
Yair Caro, Michael A. Henning
A Greedy Partition Lemma for directed domination. Discret. Optim. 8 (3) (2011)
Yair Caro, Douglas B. West, Raphael Yuster
Equitable Hypergraph Orientations. Electron. J. Comb. 18 (1) (2011)
Yair Caro, Raphael Yuster
Colorful monochromatic connectivity. Discret. Math. 311 (16) (2011)
Yair Caro, Raphael Yuster
Large induced subgraphs with equated maximum degree. Discret. Math. 310 (4) (2010)
Yair Caro, Douglas B. West
Repetition Number of Graphs. Electron. J. Comb. 16 (1) (2009)
Yair Caro, Raphael Yuster
Large disjoint subgraphs with the same order and size. Eur. J. Comb. 30 (4) (2009)
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
On Rainbow Connection. Electron. J. Comb. 15 (1) (2008)
Yair Caro, Dieter Rautenbach
Reconstructing graphs from size and degree properties of their induced k-subgraphs. Discret. Math. 307 (6) (2007)
Yair Caro, William Klostermeyer, Raphael Yuster
Connected odd dominating sets in graphs. Discuss. Math. Graph Theory 25 (3) (2005)
Yair Caro, Yehuda Roditty
Connected colorings of graphs. Ars Comb. 70 (2004)
Yair Caro, Raphael Yuster
Edge coloring complete uniform hypergraphs with many components. J. Comb. Theory, Ser. B 91 (2) (2004)
Yair Caro, Raphael Yuster
2-connected graphs with small 2-connected dominating sets. Discret. Math. 269 (1-3) (2003)
Yair Caro, Michael S. Jacobson
On non-z(mod k) dominating sets. Discuss. Math. Graph Theory 23 (1) (2003)
Yair Caro, Raphael Yuster
The Order of Monochromatic Subgraphs with a Given Minimum Degree. Electron. J. Comb. 10 (2003)
Yair Caro, Arieh Lev, Yehuda Roditty
Some results in step domination of graphs. Ars Comb. 68 (2003)
Yair Caro, Yehuda Roditty, Johanan Schönheim
having lambda edges. Discret. Math. 247 (1-3) (2002)
Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
Zero-sum Square Matrices. Eur. J. Comb. 23 (5) (2002)
Yair Caro, Raphael Yuster
List decomposition of graphs. Discret. Math. 243 (1-3) (2002)
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
Covering Non-uniform Hypergraphs. J. Comb. Theory, Ser. B 82 (2) (2001)
Yair Caro, Cecil C. Rousseau
Asymptotic Bounds for Bipartite Ramsey Numbers. Electron. J. Comb. 8 (1) (2001)
Yair Caro, John L. Goldwasser, William Klostermeyer
Odd and residue domination numbers of a graph. Discuss. Math. Graph Theory 21 (1) (2001)
Yair Caro, Raphael Yuster
Intersecting Designs. J. Comb. Theory, Ser. A 89 (1) (2000)
Yair Caro, Raphael Yuster
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. Electron. J. Comb. 7 (2000)
Yair Caro, Yehuda Roditty
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000)
Yair Caro, Yehuda Roditty, Johanan Schönheim
Covering designs with minimum overlap. Ars Comb. 55 (2000)
Yair Caro, Raphael Yuster
Dominating A Family Of Graphs With Small Connected Subgraphs. Comb. Probab. Comput. 9 (4) (2000)
Yair Caro, Yusheng Li, Cecil C. Rousseau, Yuming Zhang
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers. Discret. Math. 220 (1-3) (2000)
Yair Caro, Douglas B. West, Raphael Yuster
Connected Domination and Spanning Trees with Many Leaves. SIAM J. Discret. Math. 13 (2) (2000)
Yair Caro, Raphael Yuster
Graphs with Large Variance. Ars Comb. 57 (2000)
Yair Caro, Bert L. Hartnell
-well-covered graphs of girth 6 or more. J. Graph Theory 33 (4) (2000)
Yair Caro, Raphael Yuster
Graph Decomposition of Slim Graphs. Graphs Comb. 15 (1) (1999)
Yair Caro, Raphael Yuster
Graphs Having the Local Decomposition Property. Ars Comb. 52 (1999)
Yair Caro, Raphael Yuster
Orthogonal Colorings of Graphs. Electron. J. Comb. 6 (1999)
Yair Caro, Christian Provstgaard
Zero-sum delta-systems and multiple copies of graphs. J. Graph Theory 32 (2) (1999)
Yair Caro, Raphael Yuster
The uniformity space of hypergraphs and its applications. Discret. Math. 202 (1-3) (1999)
Yair Caro, Raphael Yuster
Orthogonal Decomposition and Packing of Complete Graphs. J. Comb. Theory, Ser. A 88 (1) (1999)
Yair Caro
On graphs determined by their k-subgraphs. Ars Comb. 49 (1998)
Yair Caro, Mark N. Ellingham, J. E. Ramey
Local Structure When All Maximal Independent Sets Have Equal Weight. SIAM J. Discret. Math. 11 (4) (1998)
Yair Caro, Raphael Yuster
The characterization of zero-sum (mod 2) bipartite Ramsey numbers. J. Graph Theory 29 (3) (1998)
Yair Caro, Raphael Yuster
Covering Graphs: The Covering Problem Solved. J. Comb. Theory, Ser. A 83 (2) (1998)
Yair Caro
Binomial Coefficients and Zero-Sum Ramsey Numbers. J. Comb. Theory, Ser. A 80 (2) (1997)
Yair Caro, Raphael Yuster
Recognizing Global Occurrence of Local Properties. J. Complex. 13 (3) (1997)
Yair Caro, Raphael Yuster
Efficient Covering Designs of the Complete Graph. Electron. J. Comb. 4 (1) (1997)
Yair Caro
Subdivisions, parity and well-covered graphs. J. Graph Theory 25 (1) (1997)
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) (1997)
Yair Caro, Yehuda Roditty, Johanan Schönheim
On colored designs - I. Discret. Math. 164 (1-3) (1997)
Yair Caro, Raphael Yuster
Packing Graphs: The packing problem solved. Electron. J. Comb. 4 (1) (1997)
Yair Caro
Zero-sum problems - A survey. Discret. Math. 152 (1-3) (1996)
Yair Caro, András Sebö, Michael Tarsi
Recognizing Greedy Structures. J. Algorithms 20 (1) (1996)
Yair Caro
Simple proffs to three parity theorems. Ars Comb. 42 (1996)
Yair Caro
On the generalized Erdös-Szekeres Conjecture - a new upper bound. Discret. Math. 160 (1-3) (1996)
Yair Caro
Exact cuts and a simple proof of the zero graphs theorem. Ars Comb. 41 (1995)
Yair Caro, Yehuda Roditty, Johanan Schönheim
On colored designs - II. Discret. Math. 138 (1-3) (1995)
Yair Caro, Yehuda Roditty
A zero-sum conjecture for trees. Ars Comb. 40 (1995)
Yair Caro
On induced subgraphs with odd degrees. Discret. Math. 132 (1-3) (1994)
Yair Caro, Ilia Krasikov, Yehuda Roditty
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125 (1-3) (1994)
Yair Caro
A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers. J. Comb. Theory, Ser. A 68 (1) (1994)
Noga Alon, Yair Caro, Ilia Krasikov
Bisection of trees and sequences. Discret. Math. 114 (1-3) (1993)
Yair Caro, Zsolt Tuza
Bounded degrees and prescribed distances in graphs. Discret. Math. 111 (1-3) (1993)

Yair Caro.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yair Caro