| 1 | -- | 5 | Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West. Clique coverings of the edges of a random graph |
| 7 | -- | 30 | Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner. Decomposition of 3-connected graphs |
| 31 | -- | 56 | Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. Turán-Ramsey theorems and simple asymptotically extremal structures |
| 57 | -- | 63 | Paul Erdös, L. Bruce Richmond. On graphical partitions |
| 65 | -- | 81 | András Frank. Conservative weightings and ear-decompositions of graphs |
| 83 | -- | 96 | George S. Lueker, Mariko Molodowitch. More analysis of double hashing |
| 97 | -- | 107 | Matthias Middendorf, Frank Pfeiffer. On the complexity of the disjoint paths problems |
| 109 | -- | 120 | Alexander Sidorenko. Boundedness of optimal matrices in extremal multigraph and digraph problems |
| 121 | -- | 125 | Oleg V. Borodin. Joint extension of two theorems of Kotzig on 3-polytopes |
| 127 | -- | 128 | Zhen Zhang. A note on arrays of dots wit distinct slopes |