Journals in DBLP

Combinatorica
1991, volume: 11, number: 4

1. Béla Bollobás, Imre Leader
   Edge-isoperimetric inequalities in the grid. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:299-314 [Journal]
   
2. André Bouchet
   An efficient algorithm to recognize locally equivalent graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:315-329 [Journal]
   
3. Joel Friedman
   On the second eigenvalue and random walks n random d-regular graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:331-362 [Journal]
   
4. Jeff Kahn, Nathan Linial
   Balancing extensions via Brunn-Minkowski. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:363-368 [Journal]
   
5. Brendan D. McKay, Nicholas C. Wormald
   Asymptotic enumeration by degree sequence of graphs with degress o(n^1/2). [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:369-382 [Journal]
   
6. Michael E. Saks, Michael Werman
   On computing majority by comparisons. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:383-387 [Journal]
   
7. Yoshimi Egawa, Akira Saito
   Contractible edges in non-separating cycles. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:389-392 [Journal]
   
8. Carsten Thomassen
   Highly connected non-2-linked digraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:4, pp:393-395 [Journal]