1. The uniqueness of the near hexagon on 729 points

   • A. E. Brouwer

   OriginalPaper Pages: 333 - 340

2. On the vector space of 0-configurations

   • M. Deza
   • P. Frankl

   OriginalPaper Pages: 341 - 345

3. On the connectivity of randomm-orientable graphs and digraphs

   • T. I. Fenner
   • A. M. Frieze

   OriginalPaper Pages: 347 - 359

4. Disjoint paths in a rectilinear grid

   • A Frank

   OriginalPaper Pages: 361 - 371

5. On 3-skein isomorphisms of graphs

   • H. A. Jung
   • A. K. Kelmans
   • R. L. Hemminger

   OriginalPaper Pages: 373 - 376

6. Nearly bipartite graphs with large chromatic number

   • Vojtěch Rödl

   OriginalPaper Pages: 377 - 383

7. An analysis of the greedy algorithm for the submodular set covering problem

   • L. A. Wolsey

   OriginalPaper Pages: 385 - 393

8. On a geometric property of perfect graphs

   • L. S. Zaremba
   • S. Perz

   OriginalPaper Pages: 395 - 397