Journals in DBLP

Combinatorica
1981, volume: 1, number: 1

1. Miklós Ajtai, János Komlós, Endre Szemerédi
   The longest path in a random graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:1-12 [Journal]
   
2. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
   Minimal decompositions of graphs into mutually isomorphic subgraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:13-24 [Journal]
   
3. Paul Erdös
   On the combinatorial problems which I would most like to see solved. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:25-42 [Journal]
   
4. Heinz Gröflin, Alan J. Hoffman
   On matroid intersections. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:43-47 [Journal]
   
5. Daniel J. Kleitman, Kenneth J. Winston
   Forests and score vectors. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:49-54 [Journal]
   
6. Shuo-Yen Robert Li, Wen-Ch'ing Winnie Li
   Independence numbers of graphs and generators of ideals. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:55-61 [Journal]
   
7. Jacobus H. van Lint, Alexander Schrijver
   Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:63-73 [Journal]
   
8. Paul D. Seymour
   Reconizing graphic matroids. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:75-78 [Journal]
   
9. W. T. Tutte
   Graph factors. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:1, pp:79-97 [Journal]