Journals in DBLP

Combinatorica
2001, volume: 21, number: 2

1. Noga Alon, János Pach, József Solymosi
   Ramsey-type Theorems with Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:155-170 [Journal]
   
2. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
   Vertex Covers by Edge Disjoint Cliques. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:171-197 [Journal]
   
3. Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
   On Bipartite Graphs with Linear Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:199-209 [Journal]
   
4. Y. Katznelson
   Chromatic Numbers of Cayley Graphs on Z and Recurrence. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:211-219 [Journal]
   
5. Daniel J. Kleitman, András Gyárfás, Géza Tóth
   Convex Sets in the Plane with Three of Every Four Meeting. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:221-232 [Journal]
   
6. Péter Komjáth
   Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:233-238 [Journal]
   
7. J. Korevaar
   Tauberian Theorem of Erdos Revisited. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:239-250 [Journal]
   
8. Wolfgang Mader
   Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:251-265 [Journal]
   
9. Dieter Rautenbach, Bruce A. Reed
   The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2001, v:21, n:2, pp:267-278 [Journal]
   
10. Imre Z. Ruzsa
    Additive Completion of Lacunary Sequences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:279-291 [Journal]
    
11. Norbert Sauer
    Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:293-308 [Journal]
    
12. Saharon Shelah
    Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:309-319 [Journal]
    
13. Carsten Thomassen
    The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:321-333 [Journal]