Journals in DBLP

Combinatorica
1984, volume: 4, number: 1

1. Ron Aharoni
   On an obstruction for perfect matching. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:1-7 [Journal]
   
2. Béla Bollobás, Victor Klee
   Diameters of random bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:7-19 [Journal]
   
3. Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
   Intersecting Sperner families and their convex hulls. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:21-34 [Journal]
   
4. Siemion Fajtlowicz
   Independence, clique size and maximum degree. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:35-38 [Journal]
   
5. Peter Frankl, János Pach
   On disjointly representable sets. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:39-45 [Journal]
   
6. András Hajnal, Péter Komjáth
   What must and what need not be contained in a graph of uncountable chromatic number?. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:47-52 [Journal]
   
7. Wilfried Imrich
   Explicit construction of regular graphs without small cycles. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:53-59 [Journal]
   
8. Amram Meir, John W. Moon
   On random mapping patterns. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:61-70 [Journal]
   
9. Jaroslav Nesetril, Vojtech Rödl
   Sparse Ramsey graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:71-78 [Journal]
   
10. Kevin T. Phelps, Vojtech Rödl
    On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:79-88 [Journal]
    
11. Horst Sachs
    Perfect matchings in hexagonal systems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:89-99 [Journal]
    
12. Miklós Simonovits, Vera T. Sós
    On restricted colourings of K_n. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:101-110 [Journal]
    
13. Zsolt Tuza
    Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:111-116 [Journal]
    
14. Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor
    Regressions and monotone chains: a ramsey - type extermal problem for partial orders. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:117-119 [Journal]