1. On well-quasi-ordering-finite graphs by immersion

   • Thomas Andreae

   OriginalPaper Pages: 287 - 298

2. Adjoints of oriented matroids

   • A. Bachem
   • W. Kern

   OriginalPaper Pages: 299 - 308

3. Extremal clique coverings of complementary graphs

   • D. de Caen
   • P. Erdős
   • N. C. Wormald

   OriginalPaper Pages: 309 - 314

4. Counterexamples to conjectures on 4-connected matroids

   • Collette R. Coullard

   OriginalPaper Pages: 315 - 320

5. A completion problem for finite affine planes

   • Stephen Dow

   OriginalPaper Pages: 321 - 325

6. Some intersection theorems on two-valued functions

   • R. J. Faudree
   • R. H. Schelp
   • V. T. Sós

   OriginalPaper Pages: 327 - 333

   

7. Finite projective spaces and intersecting hypergraphs

   • P. Frankl
   • Z. Füredi

   OriginalPaper Pages: 335 - 354

   

8. Families of finite sets with minimum shadows

   • Z. Füredi
   • J. R. Griggs

   OriginalPaper Pages: 355 - 363

9. Matrices with the edmonds—Johnson property

   • A. M. H. Gerards
   • A. Schrijver

   OriginalPaper Pages: 365 - 379

10. Coloring planar perfect graphs by decomposition

    • W. -L. Hsu

    OriginalPaper Pages: 381 - 385

11. A las vegas rnc algorithm for maximum matching

    • Howard J. Karloff

    OriginalPaper Pages: 387 - 391

12. Clique covering of graphs

    • L. Pyber

    OriginalPaper Pages: 393 - 398