Journals in DBLP

Combinatorica
1982, volume: 2, number: 1

1. Miklós Ajtai, János Komlós, Endre Szemerédi
   Largest random component of a k-cube. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:1-7 [Journal]
   
2. Peter J. Cameron
   There are only finitely many finite distance-transitive graphs of given valency greater than two. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:9-13 [Journal]
   
3. M. J. Dunwoody
   Cutting up graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:15-23 [Journal]
   
4. Hans-Dietrich O. F. Gronau
   On Sperner families in which no k sets have an empty intersection III. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:25-36 [Journal]
   
5. Anthony J. W. Hilton
   Canonical edge-colourings of locally finite graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:37-51 [Journal]
   
6. Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
   A nine point theorem for 3-connected graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:53-62 [Journal]
   
7. H. D. Macpherson
   Infinite distance transitive graphs of finite valency. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:63-69 [Journal]
   
8. G. A. Margulis
   Explicit constructions of graphs without short cycles and low density codes. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:71-78 [Journal]
   
9. Richard J. Nowakowski, Ivan Rival
   On a class of isometric subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1982, v:2, n:1, pp:79-90 [Journal]
   
10. Paul D. Seymour
    Packing nearly-disjoint sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:91-97 [Journal]
    
11. W. D. Wallis
    Asymptotic values of clique partition numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:99-101 [Journal]