Journals in DBLP

Combinatorica
1985, volume: 5, number: 4

1. R. W. Decker, H. H. Glover, L. P. Huneke
   Computing the genus of the 2-amalgamations of graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:271-282 [Journal]
   
2. Reinhard Diestel, Rudolf Halin, Walter Vogler
   Some remarks on universal graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:283-293 [Journal]
   
3. Mohamed M. El-Zahar, Paul Erdös
   On the existence of two non-neighboring subgraphs in a graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:295-300 [Journal]
   
4. Konrad Engel, Nikolai N. Kuzjurin
   About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:301-309 [Journal]
   
5. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
   Multipartite graph - space graph Ramsey numbers. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:311-318 [Journal]
   
6. Jeff Kahn
   A problem of P. Seymour on nonbinary matroids. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:319-323 [Journal]
   
7. Alexander V. Karzanov
   Families of cuts with the MFMC-property. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:325-336 [Journal]
   
8. H. J. Landau, B. F. Logan, Larry A. Shepp
   An inequality conjectured by Hajela and Seymour arising in combinatorial geometry. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:337-342 [Journal]
   
9. James G. Oxley
   Proof of a conjecture of Kahn for non-binary matroids. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:4, pp:343-345 [Journal]
   
10. László Pyber
    Regular subgraphs of dense graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:347-349 [Journal]
    
11. S. S. Shrikhande, N. M. Singhi
    On a problem of Erdös and Larson. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:351-358 [Journal]
    
12. K. Steffens
    Maximal tight sets and the Edmonds - Gallai decomposition for matchings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:359-365 [Journal]
    
13. Robert Endre Tarjan
    Sequential access in play trees takes linear time. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:367-378 [Journal]