Journals in DBLP

Combinatorica
1984, volume: 4, number: 4

1. Miklós Ajtai, János Komlós, Gábor E. Tusnády
   On optimal matchings. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:259-264 [Journal]
   
2. Mark N. Ellingham, Derek A. Holton, Charles H. C. Little
   Cycles through ten vertices in 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:265-273 [Journal]
   
3. Hikoe Enomoto, Akira Saito
   Disjoint shortest paths in graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:275-279 [Journal]
   
4. Heinz Gröflin
   Path-closed sets. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:281-290 [Journal]
   
5. Martin Grötschel, László Lovász, Alexander Schrijver
   Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:291-295 [Journal]
   
6. Jeff Kahn, Michael E. Saks, Dean Sturtevant
   A topological approach to evasiveness. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:297-306 [Journal]
   
7. Alexandr V. Kostochka
   Lower bound of the Hadwiger number of graphs by their average degree. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:307-316 [Journal]
   
8. Igor Kríz
   A class of dimension-skipping graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:317-319 [Journal]
   
9. Jacobus H. van Lint
   On equidistant binary codes length n = 4k+1 with distance d = 2k. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:4, pp:321-323 [Journal]
   
10. Brendan D. McKay, Nicholas C. Wormald
    Automorphisms of random graphs with specified vertices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:325-338 [Journal]
    
11. Michael von Rimscha
    The reconstruction problem for certain infinite graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:339-344 [Journal]
    
12. Vojtech Rödl
    On combinatorial properties of spheres in eulidean spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:345-349 [Journal]
    
13. Norbert Seifter
    On automorphisms of infinite graphs with forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:351-356 [Journal]
    
14. Douglas R. Stinson, G. H. John van Rees
    The equivalence of certain equidistant binary codes and symmetric BIBDs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:357-362 [Journal]
    
15. László A. Székely
    On the number of homogeneous subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:363-372 [Journal]
    
16. Narendra Karmarkar
    A new polynomial-time algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:373-396 [Journal]