According to our database
1,
Yair Caro
authored at least 114 papers
between 1981 and 2023.
Collaborative distances:
2023
Sum-distinguishing number of sparse hypergraphs.
Eur. J. Comb., August, 2023
Remarks on proper conflict-free colorings of graphs.
Discret. Math., 2023
The feasibility problem for line graphs.
Discret. Appl. Math., 2023
Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas.
Electron. J. Comb., 2023
Graphs with constant balancing number.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
On small balanceable, strongly-balanceable and omnitonal graphs.
Discuss. Math. Graph Theory, 2022
New results relating inependence and matchings.
Discuss. Math. Graph Theory, 2022
Index of parameters of iterated line graphs.
Discret. Math., 2022
Remarks on odd colorings of graphs.
Discret. Appl. Math., 2022
On Zero-Sum Spanning Trees and Zero-Sum Connectivity.
Electron. J. Comb., 2022
2021
Unavoidable chromatic patterns in 2-colorings of the complete graph.
J. Graph Theory, 2021
Recursive constructions of amoebas.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
Induced subgraphs with many repeated degrees.
Discret. Math., 2020
A note on totally-omnitonal graphs.
Bull. ICA, 2020
2019
Zero-sum subsequences in bounded-sum {-1, 1}-sequences.
J. Comb. Theory, Ser. A, 2019
Zero-Sum K<sub>m</sub> Over Z and the Story of K<sub>4</sub>.
Graphs Comb., 2019
Extremal k-forcing sets in oriented graphs.
Discret. Appl. Math., 2019
Irregular independence and irregular domination.
Discret. Appl. Math., 2019
Notes on spreads of degrees in graphs.
Bull. ICA, 2019
2018
The Effect of Local Majority on Global Majorityin Connected Graphs.
Graphs Comb., 2018
2017
Ramsey numbers for degree monotone paths.
Discret. Math., 2017
2016
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ.
Graphs Comb., 2016
Selective hypergraph colourings.
Discret. Math., 2016
Regular independent sets.
Discret. Appl. Math., 2016
2015
Electron. Notes Discret. Math., 2015
The saturation number for the length of degree monotone paths.
Discuss. Math. Graph Theory, 2015
Constrained colouring and σ-hypergraphs.
Discuss. Math. Graph Theory, 2015
(2, 2)-colourings and clique-free σ-hypergraphs.
Discret. Appl. Math., 2015
Upper bounds on the k-forcing number of a graph.
Discret. Appl. Math., 2015
Barycentric and zero-sum Ramsey numbers.
Ars Comb., 2015
Independence and matchings in σ-hypergraphs.
Australas. J Comb., 2015
2014
Simultaneous Domination in Graphs.
Graphs Comb., 2014
Non-monochromatic non-rainbow colourings of σ-hypergraphs.
Discret. Math., 2014
Forcing $k$-repetitions in Degree Sequences.
Electron. J. Comb., 2014
Degree sequence index strategy.
Australas. J Comb., 2014
2013
Partitions of graphs into small and large sets.
Discret. Appl. Math., 2013
New Approach to the k-Independence Number of a Graph.
Electron. J. Comb., 2013
2012
Fair domination in graphs.
Discret. Math., 2012
Directed domination in oriented graphs.
Discret. Appl. Math., 2012
Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number.
Electron. J. Comb., 2012
2011
Colorful monochromatic connectivity.
Discret. Math., 2011
A Greedy Partition Lemma for directed domination.
Discret. Optim., 2011
Equitable Hypergraph Orientations.
Electron. J. Comb., 2011
2010
Large induced subgraphs with equated maximum degree.
Discret. Math., 2010
2009
Large disjoint subgraphs with the same order and size.
Eur. J. Comb., 2009
Repetition Number of Graphs.
Electron. J. Comb., 2009
2008
2007
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discret. Math., 2007
2005
Connected odd dominating sets in graphs.
Discuss. Math. Graph Theory, 2005
2004
Edge coloring complete uniform hypergraphs with many components.
J. Comb. Theory, Ser. B, 2004
Connected colorings of graphs.
Ars Comb., 2004
2003
On non-z(mod k) dominating sets.
Discuss. Math. Graph Theory, 2003
2-connected graphs with small 2-connected dominating sets.
Discret. Math., 2003
The Order of Monochromatic Subgraphs with a Given Minimum Degree.
Electron. J. Comb., 2003
Some results in step domination of graphs.
Ars Comb., 2003
2002
Zero-sum Square Matrices.
Eur. J. Comb., 2002
List decomposition of graphs.
Discret. Math., 2002
On colored designs-III: on lambda-colored <i>H</i>-designs, <i>H</i> having lambda edges.
Discret. Math., 2002
2001
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B, 2001
Odd and residue domination numbers of a graph.
Discuss. Math. Graph Theory, 2001
Asymptotic Bounds for Bipartite Ramsey Numbers.
Electron. J. Comb., 2001
2000
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discret. Math., 2000
A characterization of Z<sub>m</sub>-well-covered graphs of girth 6 or more.
J. Graph Theory, 2000
J. Comb. Theory, Ser. A, 2000
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers.
Discret. Math., 2000
Dominating A Family Of Graphs With Small Connected Subgraphs.
Comb. Probab. Comput., 2000
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.
Electron. J. Comb., 2000
Graphs with Large Variance.
Ars Comb., 2000
Covering designs with minimum overlap.
Ars Comb., 2000
Improved bounds for the product of the domination and chromatic numbers of a graph.
Ars Comb., 2000
1999
Zero-sum delta-systems and multiple copies of graphs.
J. Graph Theory, 1999
Orthogonal Decomposition and Packing of Complete Graphs.
J. Comb. Theory, Ser. A, 1999
Graph Decomposition of Slim Graphs.
Graphs Comb., 1999
The uniformity space of hypergraphs and its applications.
Discret. Math., 1999
Orthogonal Colorings of Graphs.
Electron. J. Comb., 1999
Graphs Having the Local Decomposition Property.
Ars Comb., 1999
1998
Local Structure When All Maximal Independent Sets Have Equal Weight.
SIAM J. Discret. Math., 1998
The characterization of zero-sum (mod 2) bipartite Ramsey numbers.
J. Graph Theory, 1998
Covering Graphs: The Covering Problem Solved.
J. Comb. Theory, Ser. A, 1998
On graphs determined by their k-subgraphs.
Ars Comb., 1998
1997
Subdivisions, parity and well-covered graphs.
J. Graph Theory, 1997
Binomial Coefficients and Zero-Sum Ramsey Numbers.
J. Comb. Theory, Ser. A, 1997
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
J. Comb. Theory, Ser. B, 1997
Recognizing Global Occurrence of Local Properties.
J. Complex., 1997
Efficient Covering Designs of the Complete Graph.
Electron. J. Comb., 1997
Packing Graphs: The packing problem solved.
Electron. J. Comb., 1997
1996
Recognizing Greedy Structures.
J. Algorithms, 1996
On the generalized Erdös-Szekeres Conjecture - a new upper bound.
Discret. Math., 1996
Zero-sum problems - A survey.
Discret. Math., 1996
Simple proffs to three parity theorems.
Ars Comb., 1996
1995
A zero-sum conjecture for trees.
Ars Comb., 1995
Exact cuts and a simple proof of the zero graphs theorem.
Ars Comb., 1995
1994
A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers.
J. Comb. Theory, Ser. A, 1994
On induced subgraphs of trees, with restricted degrees.
Discret. Math., 1994
On induced subgraphs with odd degrees.
Discret. Math., 1994
1993
On three zero-sum Ramsey-type problems.
J. Graph Theory, 1993
Bounded degrees and prescribed distances in graphs.
Discret. Math., 1993
Bisection of trees and sequences.
Discret. Math., 1993
1992
On several variations of the turan and ramsey numbers.
J. Graph Theory, 1992
On zero-sum Ramsey numbers - stars.
Discret. Math., 1992
1991
Improved lower bounds on <i>k</i>-independence.
J. Graph Theory, 1991
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory, 1991
On zero-sum delta-systems and multiple copies of hypergraphs.
J. Graph Theory, 1991
Hypergraph coverings and local colorings.
J. Comb. Theory, Ser. B, 1991
1990
A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
Discret. Math., 1990
1989
Combinatorial reconstruction problems.
J. Comb. Theory, Ser. B, 1989
Sub-Ramsey numbers for arithmetic progressions.
Graphs Comb., 1989
1987
Extremal problems concerning transformations of the edges of the complete hypergraphs.
J. Graph Theory, 1987
1986
Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph.
Eur. J. Comb., 1986
1984
The decomposition of trees into subtrees.
J. Graph Theory, 1984
1981
Generalized 1-factorization of trees.
Discret. Math., 1981
