default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYair Caro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j114]Yair Caro, Balázs Patkós, Zsolt Tuza:
Connected Turán number of trees. Ars Math. Contemp. 24(4): 4 (2024)- [j113]Yair Caro, Josef Lauri, Xandru Mifsud
, Raphael Yuster, Christina Zarb:
Flip colouring of graphs. Graphs Comb. 40(6): 106 (2024) - 2023
- [j112]Yair Caro, Adriana Hansberg, Amanda Montejano:
Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas. Electron. J. Comb. 30(3) (2023) - [j111]Yair Caro, Josef Lauri, Christina Zarb:
The feasibility problem for line graphs. Discret. Appl. Math. 324: 167-180 (2023) - [j110]Yair Caro, Mirko Petrusevski, Riste Skrekovski:
Remarks on proper conflict-free colorings of graphs. Discret. Math. 346(2): 113221 (2023) - [j109]Maria Axenovich, Yair Caro, Raphael Yuster:
Sum-distinguishing number of sparse hypergraphs. Eur. J. Comb. 112: 103712 (2023) - [c2]Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano:
Graphs with constant balancing number. LAGOS 2023: 325-333 - 2022
- [j108]Yair Caro, Adriana Hansberg, Josef Lauri, Christina Zarb:
On Zero-Sum Spanning Trees and Zero-Sum Connectivity. Electron. J. Comb. 29(1) (2022) - [j107]Yair Caro, Mirko Petrusevski, Riste Skrekovski:
Remarks on odd colorings of graphs. Discret. Appl. Math. 321: 392-401 (2022) - [j106]Yair Caro, Josef Lauri, Christina Zarb:
Index of parameters of iterated line graphs. Discret. Math. 345(8): 112920 (2022) - [j105]Yair Caro, Randy Davila, Ryan Pepper:
New results relating inependence and matchings. Discuss. Math. Graph Theory 42(3): 921-935 (2022) - [j104]Yair Caro, Josef Lauri, Christina Zarb:
On small balanceable, strongly-balanceable and omnitonal graphs. Discuss. Math. Graph Theory 42(4): 1219-1235 (2022) - 2021
- [j103]Yair Caro, Adriana Hansberg, Amanda Montejano:
Unavoidable chromatic patterns in 2-colorings of the complete graph. J. Graph Theory 97(1): 123-147 (2021) - [c1]Adriana Hansberg, Amanda Montejano, Yair Caro:
Recursive constructions of amoebas. LAGOS 2021: 257-265 - 2020
- [j102]Yair Caro, Zsolt Tuza:
Regular Turán numbers. Australas. J Comb. 78: 133-144 (2020) - [j101]Yair Caro, Josef Lauri, Christina Zarb:
A note on totally-omnitonal graphs. Bull. ICA 89: 34-40 (2020) - [j100]Yair Caro, Raphael Yuster:
Induced subgraphs with many repeated degrees. Discret. Math. 343(5): 111828 (2020)
2010 – 2019
- 2019
- [j99]Yair Caro, Josef Lauri, Christina Zarb:
Notes on spreads of degrees in graphs. Bull. ICA 85: 79-91 (2019) - [j98]Yair Caro, Randy Davila, Ryan Pepper:
Extremal k-forcing sets in oriented graphs. Discret. Appl. Math. 262: 42-55 (2019) - [j97]Peter Borg, Yair Caro, Kurt Fenech:
Irregular independence and irregular domination. Discret. Appl. Math. 266: 76-84 (2019) - [j96]Yair Caro, Adriana Hansberg, Amanda Montejano:
Zero-Sum Km Over Z and the Story of K4. Graphs Comb. 35(4): 855-865 (2019) - [j95]Yair Caro, Adriana Hansberg, Amanda Montejano:
Zero-sum subsequences in bounded-sum {-1, 1}-sequences. J. Comb. Theory A 161: 387-419 (2019) - 2018
- [j94]Yair Caro, Raphael Yuster:
The Effect of Local Majority on Global Majorityin Connected Graphs. Graphs Comb. 34(6): 1469-1487 (2018) - 2017
- [j93]Yair Caro, Raphael Yuster, Christina Zarb:
Ramsey numbers for degree monotone paths. Discret. Math. 340(2): 124-131 (2017) - 2016
- [j92]Yair Caro, Adriana Hansberg, Ryan Pepper:
Regular independent sets. Discret. Appl. Math. 203: 35-46 (2016) - [j91]Yair Caro, Josef Lauri, Christina Zarb:
Selective hypergraph colourings. Discret. Math. 339(4): 1232-1241 (2016) - [j90]Yair Caro, Raphael Yuster:
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. Graphs Comb. 32(1): 49-63 (2016) - 2015
- [j89]Yair Caro, Josef Lauri, Christina Zarb:
Independence and matchings in σ-hypergraphs. Australas. J Comb. 63: 12-33 (2015) - [j88]Yair Caro, Leida Gonzalez, Luz Elimar Marchan, Oscar Ordaz:
Barycentric and zero-sum Ramsey numbers. Ars Comb. 123: 125-150 (2015) - [j87]David Amos, Yair Caro, Randy Davila, Ryan Pepper:
Upper bounds on the k-forcing number of a graph. Discret. Appl. Math. 181: 1-10 (2015) - [j86]Yair Caro, Josef Lauri, Christina Zarb:
(2, 2)-colourings and clique-free σ-hypergraphs. Discret. Appl. Math. 185: 38-43 (2015) - [j85]Yair Caro, Josef Lauri, Christina Zarb:
Constrained colouring and σ-hypergraphs. Discuss. Math. Graph Theory 35(1): 171-189 (2015) - [j84]Yair Caro, Josef Lauri, Christina Zarb:
The saturation number for the length of degree monotone paths. Discuss. Math. Graph Theory 35(3): 557-569 (2015) - [j83]Adriana Hansberg, Yair Caro:
Isolation in graphs. Electron. Notes Discret. Math. 50: 465-470 (2015) - 2014
- [j82]Yair Caro, Ryan Pepper:
Degree sequence index strategy. Australas. J Comb. 59: 1-23 (2014) - [j81]Yair Caro, Asaf Shapira, Raphael Yuster:
Forcing $k$-repetitions in Degree Sequences. Electron. J. Comb. 21(1): 1 (2014) - [j80]Yair Caro, Josef Lauri:
Non-monochromatic non-rainbow colourings of σ-hypergraphs. Discret. Math. 318: 96-104 (2014) - [j79]Yair Caro, Michael A. Henning:
Simultaneous Domination in Graphs. Graphs Comb. 30(6): 1399-1416 (2014) - 2013
- [j78]Yair Caro, Adriana Hansberg:
New Approach to the k-Independence Number of a Graph. Electron. J. Comb. 20(1): 33 (2013) - [j77]Asen Bojilov, Yair Caro, Adriana Hansberg, Nedyalko Nenov:
Partitions of graphs into small and large sets. Discret. Appl. Math. 161(13-14): 1912-1924 (2013) - 2012
- [j76]Yair Caro, Adriana Hansberg:
Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number. Electron. J. Comb. 19(3): 16 (2012) - [j75]Yair Caro, Michael A. Henning:
Directed domination in oriented graphs. Discret. Appl. Math. 160(7-8): 1053-1063 (2012) - [j74]Yair Caro, Adriana Hansberg, Michael A. Henning:
Fair domination in graphs. Discret. Math. 312(19): 2905-2914 (2012) - 2011
- [j73]Yair Caro, Douglas B. West, Raphael Yuster:
Equitable Hypergraph Orientations. Electron. J. Comb. 18(1) (2011) - [j72]Yair Caro, Michael A. Henning:
A Greedy Partition Lemma for directed domination. Discret. Optim. 8(3): 452-458 (2011) - [j71]Yair Caro, Raphael Yuster:
Colorful monochromatic connectivity. Discret. Math. 311(16): 1786-1792 (2011) - 2010
- [j70]Yair Caro, Raphael Yuster:
Large induced subgraphs with equated maximum degree. Discret. Math. 310(4): 742-747 (2010)
2000 – 2009
- 2009
- [j69]Yair Caro, Douglas B. West:
Repetition Number of Graphs. Electron. J. Comb. 16(1) (2009) - [j68]Yair Caro, Raphael Yuster:
Large disjoint subgraphs with the same order and size. Eur. J. Comb. 30(4): 813-821 (2009) - 2008
- [j67]Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008) - 2007
- [j66]Yair Caro, Dieter Rautenbach:
Reconstructing graphs from size and degree properties of their induced k-subgraphs. Discret. Math. 307(6): 694-703 (2007) - 2005
- [j65]Yair Caro, William Klostermeyer, Raphael Yuster:
Connected odd dominating sets in graphs. Discuss. Math. Graph Theory 25(3): 225-239 (2005) - 2004
- [j64]Yair Caro, Yehuda Roditty:
Connected colorings of graphs. Ars Comb. 70 (2004) - [j63]Yair Caro, Raphael Yuster:
Edge coloring complete uniform hypergraphs with many components. J. Comb. Theory B 91(2): 215-227 (2004) - 2003
- [j62]Yair Caro, Arieh Lev, Yehuda Roditty:
Some results in step domination of graphs. Ars Comb. 68 (2003) - [j61]Yair Caro, Raphael Yuster:
The Order of Monochromatic Subgraphs with a Given Minimum Degree. Electron. J. Comb. 10 (2003) - [j60]Yair Caro, Raphael Yuster:
2-connected graphs with small 2-connected dominating sets. Discret. Math. 269(1-3): 265-271 (2003) - [j59]Yair Caro, Michael S. Jacobson:
On non-z(mod k) dominating sets. Discuss. Math. Graph Theory 23(1): 189-199 (2003) - 2002
- [j58]Yair Caro, Raphael Yuster:
List decomposition of graphs. Discret. Math. 243(1-3): 67-77 (2002) - [j57]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs-III: on lambda-colored H-designs, H having lambda edges. Discret. Math. 247(1-3): 51-64 (2002) - [j56]Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster:
Zero-sum Square Matrices. Eur. J. Comb. 23(5): 489-497 (2002) - 2001
- [j55]Yair Caro, Cecil C. Rousseau:
Asymptotic Bounds for Bipartite Ramsey Numbers. Electron. J. Comb. 8(1) (2001) - [j54]Yair Caro, John L. Goldwasser, William Klostermeyer:
Odd and residue domination numbers of a graph. Discuss. Math. Graph Theory 21(1): 119-136 (2001) - [j53]Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster:
Covering Non-uniform Hypergraphs. J. Comb. Theory B 82(2): 270-284 (2001) - 2000
- [j52]Yair Caro, Yehuda Roditty, Johanan Schönheim:
Covering designs with minimum overlap. Ars Comb. 55 (2000) - [j51]Yair Caro, Yehuda Roditty:
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000) - [j50]Yair Caro, Raphael Yuster:
Graphs with Large Variance. Ars Comb. 57 (2000) - [j49]Yair Caro, Raphael Yuster:
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. Electron. J. Comb. 7 (2000) - [j48]Yair Caro, Raphael Yuster:
Dominating A Family Of Graphs With Small Connected Subgraphs. Comb. Probab. Comput. 9(4): 309-313 (2000) - [j47]Yair Caro, Yusheng Li, Cecil C. Rousseau, Yuming Zhang:
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers. Discret. Math. 220(1-3): 51-56 (2000) - [j46]Yair Caro, Raphael Yuster:
Intersecting Designs. J. Comb. Theory A 89(1): 113-125 (2000) - [j45]Yair Caro, Bert L. Hartnell:
A characterization of Zm-well-covered graphs of girth 6 or more. J. Graph Theory 33(4): 246-255 (2000) - [j44]Yair Caro, Douglas B. West, Raphael Yuster:
Connected Domination and Spanning Trees with Many Leaves. SIAM J. Discret. Math. 13(2): 202-211 (2000)
1990 – 1999
- 1999
- [j43]Yair Caro, Raphael Yuster:
Graphs Having the Local Decomposition Property. Ars Comb. 52 (1999) - [j42]Yair Caro, Raphael Yuster:
Orthogonal Colorings of Graphs. Electron. J. Comb. 6 (1999) - [j41]Yair Caro, Raphael Yuster:
The uniformity space of hypergraphs and its applications. Discret. Math. 202(1-3): 1-19 (1999) - [j40]Yair Caro, Raphael Yuster:
Graph Decomposition of Slim Graphs. Graphs Comb. 15(1): 5-19 (1999) - [j39]Yair Caro, Raphael Yuster:
Orthogonal Decomposition and Packing of Complete Graphs. J. Comb. Theory A 88(1): 93-111 (1999) - [j38]Yair Caro, Christian Provstgaard:
Zero-sum delta-systems and multiple copies of graphs. J. Graph Theory 32(2): 207-216 (1999) - 1998
- [j37]Yair Caro:
On graphs determined by their k-subgraphs. Ars Comb. 49 (1998) - [j36]Yair Caro, Raphael Yuster:
Covering Graphs: The Covering Problem Solved. J. Comb. Theory A 83(2): 273-282 (1998) - [j35]Yair Caro, Raphael Yuster:
The characterization of zero-sum (mod 2) bipartite Ramsey numbers. J. Graph Theory 29(3): 151-166 (1998) - [j34]Yair Caro, Mark N. Ellingham, J. E. Ramey:
Local Structure When All Maximal Independent Sets Have Equal Weight. SIAM J. Discret. Math. 11(4): 644-654 (1998) - 1997
- [j33]Yair Caro, Raphael Yuster:
Packing Graphs: The packing problem solved. Electron. J. Comb. 4(1) (1997) - [j32]Yair Caro, Raphael Yuster:
Efficient Covering Designs of the Complete Graph. Electron. J. Comb. 4(1) (1997) - [j31]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - I. Discret. Math. 164(1-3): 47-65 (1997) - [j30]Yair Caro, Raphael Yuster:
Recognizing Global Occurrence of Local Properties. J. Complex. 13(3): 340-352 (1997) - [j29]Noga Alon, Yair Caro, Raphael Yuster:
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. J. Comb. Theory B 71(2): 144-161 (1997) - [j28]Yair Caro:
Binomial Coefficients and Zero-Sum Ramsey Numbers. J. Comb. Theory A 80(2): 367-373 (1997) - [j27]Yair Caro:
Subdivisions, parity and well-covered graphs. J. Graph Theory 25(1): 85-94 (1997) - 1996
- [j26]Yair Caro:
Simple proofs to three parity theorems. Ars Comb. 42 (1996) - [j25]Yair Caro:
Zero-sum problems - A survey. Discret. Math. 152(1-3): 93-113 (1996) - [j24]Yair Caro:
On the generalized Erdös-Szekeres Conjecture - a new upper bound. Discret. Math. 160(1-3): 229-233 (1996) - [j23]Yair Caro, András Sebö, Michael Tarsi:
Recognizing Greedy Structures. J. Algorithms 20(1): 137-156 (1996) - 1995
- [j22]Yair Caro, Yehuda Roditty:
A zero-sum conjecture for trees. Ars Comb. 40 (1995) - [j21]Yair Caro:
Exact cuts and a simple proof of the zero graphs theorem. Ars Comb. 41 (1995) - [j20]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - II. Discret. Math. 138(1-3): 177-186 (1995) - 1994
- [j19]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125(1-3): 101-106 (1994) - [j18]Yair Caro:
On induced subgraphs with odd degrees. Discret. Math. 132(1-3): 23-28 (1994) - [j17]Yair Caro:
A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers. J. Comb. Theory A 68(1): 205-211 (1994) - 1993
- [j16]Yair Caro, Zsolt Tuza:
Bounded degrees and prescribed distances in graphs. Discret. Math. 111(1-3): 87-93 (1993) - [j15]Noga Alon, Yair Caro, Ilia Krasikov:
Bisection of trees and sequences. Discret. Math. 114(1-3): 3-7 (1993) - [j14]Noga Alon, Yair Caro:
On three zero-sum Ramsey-type problems. J. Graph Theory 17(2): 177-192 (1993) - 1992
- [j13]Yair Caro:
On zero-sum Ramsey numbers - stars. Discret. Math. 104(1): 1-6 (1992) - [j12]Yair Caro:
On several variations of the turan and ramsey numbers. J. Graph Theory 16(3): 257-266 (1992) - 1991
- [j11]Yair Caro, Zsolt Tuza:
Hypergraph coverings and local colorings. J. Comb. Theory B 52(1): 79-85 (1991) - [j10]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15(1): 7-13 (1991) - [j9]Yair Caro, Zsolt Tuza:
Improved lower bounds on k-independence. J. Graph Theory 15(1): 99-107 (1991) - [j8]Yair Caro:
On zero-sum delta-systems and multiple copies of hypergraphs. J. Graph Theory 15(5): 511-521 (1991) - 1990
- [j7]Yair Caro, Yehuda Roditty:
A note on packing trees into complete bipartite graphs and on fishburn's conjecture. Discret. Math. 82(3): 323-326 (1990)
1980 – 1989
- 1989
- [j6]Noga Alon, Yair Caro, Zsolt Tuza:
Sub-Ramsey numbers for arithmetic progressions. Graphs Comb. 5(1): 307-314 (1989) - [j5]Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems. J. Comb. Theory B 47(2): 153-161 (1989) - 1987
- [j4]Yair Caro:
Extremal problems concerning transformations of the edges of the complete hypergraphs. J. Graph Theory 11(1): 25-37 (1987) - 1986
- [j3]Noga Alon, Yair Caro:
Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph. Eur. J. Comb. 7(2): 93-104 (1986) - 1984
- [j2]Yair Caro:
The decomposition of trees into subtrees. J. Graph Theory 8(4): 471-479 (1984) - 1981
- [j1]Yair Caro, Johanan Schönheim:
Generalized 1-factorization of trees. Discret. Math. 33(3): 319-321 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
