1. The perfectly Matchable Subgraph Polytope of an arbitrary graph

   • E. Balas
   • W. R. Pulleyblank

   OriginalPaper Pages: 321 - 337

2. Some new strongly regular graphs

   • A. E. Brouwer
   • A. V. Ivanov
   • M. H. Klin

   OriginalPaper Pages: 339 - 344

3. Quasi-random graphs

   • F. R. K. Chung
   • R. L. Graham
   • R. M. Wilson

   OriginalPaper Pages: 345 - 362

4. On random minimum length spanning trees

   • A. M. Frieze
   • C. J. H. McDiarmid

   OriginalPaper Pages: 363 - 374

5. The Klein bottle and multicommodity flows

   • A. Schrijver

   OriginalPaper Pages: 375 - 384

6. Query complexity, or why is it difficult to separateNP ^A ∩coNP ^A fromP ^A by random oraclesA?

   • G. Tardos

   OriginalPaper Pages: 385 - 392

7. A nowhere-zero point in linear mappings

   • N. Alon
   • M. Tarsi

   Note Pages: 393 - 395