Yair Caro

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yehuda Roditty

> Home > Persons > Yair Caro

Publications

2008
[j67]
- view
  - electronic edition @ combinatorics.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/combinatorics/CaroLRTY08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/CaroLRTY08
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008)
2004
[j64]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/CaroR04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/CaroR04
Yair Caro, Yehuda Roditty:
Connected colorings of graphs. Ars Comb. 70 (2004)
2003
[j62]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/CaroLR03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/CaroLR03
Yair Caro, Arieh Lev, Yehuda Roditty:
Some results in step domination of graphs. Ars Comb. 68 (2003)
2002
[j57]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CaroRS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CaroRS02
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)
2000
[j52]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/CaroRS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/CaroRS00
Yair Caro, Yehuda Roditty, Johanan Schönheim:
Covering designs with minimum overlap. Ars Comb. 55 (2000)
[j51]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/CaroR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/CaroR00
Yair Caro, Yehuda Roditty:
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000)
1997
[j31]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CaroRS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CaroRS97
Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - I. Discret. Math. 164(1-3): 47-65 (1997)
1995
[j22]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/CaroR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/CaroR95
Yair Caro, Yehuda Roditty:
A zero-sum conjecture for trees. Ars Comb. 40 (1995)
[j20]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CaroRS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CaroRS95
Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - II. Discret. Math. 138(1-3): 177-186 (1995)
1994
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CaroKR94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CaroKR94
Yair Caro, Ilia Krasikov, Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125(1-3): 101-106 (1994)
1991
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/CaroKR91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/CaroKR91
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)
1990
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CaroR90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CaroR90
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)
1989
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/AlonCKR89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/AlonCKR89
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems. J. Comb. Theory B 47(2): 153-161 (1989)

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.