Journals in DBLP

Combinatorica
1981, volume: 1, number: 2

1. Eiichi Bannai, Etsuko Bannai
   An upper bound for the cardinality of an s-distance subset in real Euclidean space. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:99-102 [Journal]
   
2. József Beck
   Van der Waerden and Ramsey type games. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:103-116 [Journal]
   
3. J. A. Bondy, László Lovász
   Cycles through specified vertices of a graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:117-140 [Journal]
   
4. Paul Erdös, Siemion Fajtlowicz
   On the conjecture of Hajós. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:141-143 [Journal]
   
5. András Frank
   How to make a digraph strongly connected. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:145-153 [Journal]
   
6. Zoltán Füredi
   Maximum degree and fractional matchings in uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:155-162 [Journal]
   
7. C. D. Godsil
   Equiarboreal graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:163-167 [Journal]
   
8. Martin Grötschel, László Lovász, Alexander Schrijver
   The ellipsoid method and its consequences in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:169-197 [Journal]
   
9. Jaroslav Nesetril, Vojtech Rödl
   Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1981, v:1, n:2, pp:199-202 [Journal]
   
10. Joel Spencer
    Suresums. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:203-208 [Journal]