Journals in DBLP

Combinatorica
1991, volume: 11, number: 1

1. K. T. Arasu, James A. Davis, Dieter Jungnickel, Alexander Pott
   Some nonexistence results on divisible difference sets. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:1-8 [Journal]
   
2. Endre Boros, Dieter Jungnickel, Scott A. Vanstone
   The existence of non-trivial hyperfactorization of K_2n. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:9-15 [Journal]
   
3. Jeff Kahn, Roy Meshulam
   On mod p transversals. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:17-22 [Journal]
   
4. Valerie King
   An Omega(n^5/4) lower bound on the randomized complexity of graph properties. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:23-32 [Journal]
   
5. Donald E. Knuth
   Efficient representation of perm groups. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:33-43 [Journal]
   
6. Tomasz Luczak
   The chromatic number of random graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:45-54 [Journal]
   
7. Victor Neumann-Lara, Eduardo Rivera-Campo
   Spanning trees with bounded degrees. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:55-61 [Journal]
   
8. Noam Nisan
   Pseudorandom bits for constant depth circuits. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:63-70 [Journal]
   
9. Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
   A mixed version of Menger's theorem. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:1, pp:71-74 [Journal]
   
10. Zoltán Füredi
    On a Turán type problem of Erdös. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:75-79 [Journal]