Journals in DBLP

Combinatorica
2004, volume: 24, number: 3

1. Jørgen Bang-Jensen, Anders Yeo
   Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:331-349 [Journal]
   
2. Christian Elsholtz
   Lower Bounds For Multidimensional Zero Sums. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:351-358 [Journal]
   
3. Christian Houdré, Prasad Tetali
   Isoperimetric Invariants For Product Markov Chains and Graph Products. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:359-388 [Journal]
   
4. Alexandr V. Kostochka, Vojtech Rödl
   On Graphs With Small Ramsey Numbers, II. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:389-401 [Journal]
   
5. Michael Krivelevich, Benny Sudakov, Tibor Szabó
   Triangle Factors In Sparse Pseudo-Random Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:403-426 [Journal]
   
6. Bodo Lass
   Matching Polynomials And Duality. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:427-440 [Journal]
   
7. Wolfgang Mader
   High Connectivity Keeping Sets In n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:441-458 [Journal]
   
8. Klaus Metsch
   Blocking Subspaces By Lines In PG(n, q). [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:459-486 [Journal]
   
9. Patrice Ossona de Mendez, Pierre Rosenstiehl
   Transitivity And Connectivity Of Permutations. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2004, v:24, n:3, pp:487-501 [Journal]
   
10. Toniann Pitassi, Ran Raz
    Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:503-524 [Journal]
    
11. Michael E. Saks, Alex Samorodnitsky, Leonid Zosin
    A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:525-530 [Journal]
    
12. Lutz Volkmann
    The Maximum Size Of Graphs With A Unique k- Factor. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:531-540 [Journal]