1. Tibor Gallai

   • László Lovász

   Announcement Pages: 203 - 205

2. Personal reminiscences and remarks on the mathematical work of Tibor Gallai

   • P. Erdős

   OriginalPaper Pages: 207 - 212

3. Diperfect graphs

   • Claude Berge

   OriginalPaper Pages: 213 - 222

4. Long paths in sparse random graphs

   • Béla Bollobás

   OriginalPaper Pages: 223 - 228

5. The edmonds—Gallai decomposition for matchings in locally finite graphs

   • François Bry
   • Michel Las Vergnas

   OriginalPaper Pages: 229 - 235

6. Intersection properties of boxes in R ^d

   • Ludwig Danzer
   • Branko Grünbaum

   OriginalPaper Pages: 237 - 246

7. Brick decompositions and the matching rank of graphs

   • J. Edmonds
   • W. R. Pulleyblank
   • L. Lovász

   OriginalPaper Pages: 247 - 274

8. Compactness results in extremal graph theory

   • P. Erdős
   • M. Simonovits

   OriginalPaper Pages: 275 - 288

9. On Ramsey—Turán type theorems for hypergraphs

   • P. Erdős
   • Vera T. Sós

   OriginalPaper Pages: 289 - 295

10. Some remarks on interval graphs

    • R. Halin

    OriginalPaper Pages: 297 - 304

11. Covers in hypergraphs

    • J. Lehel

    OriginalPaper Pages: 305 - 309

12. Atoms of families of sets

    • Richard Rado

    OriginalPaper Pages: 311 - 314

13. Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs

    • Michael Stiebitz

    OriginalPaper Pages: 315 - 323

14. The method of alternating paths

    • W. T. Tutte

    OriginalPaper Pages: 325 - 332