| 105 | -- | 126 | W. T. Tutte. On the enumeration of convex polyhedra |
| 115 | -- | 124 | Glen Mullineux. A Bijection of the Set of 3-Regular Partitions |
| 125 | -- | 129 | Richard Crittenden, Charles Vanden Eynden. Completing Partial Latin Squares |
| 127 | -- | 141 | Ioan Tomescu. Some properties of irreducible coverings by cliques of complete multipartite graphs |
| 130 | -- | 139 | Wayne M. Dymàcek, D. P. Roselle. Cyclic Designs and Uniformly Deep Families |
| 140 | -- | 149 | Carl Pomerance. Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi s Theorem |
| 142 | -- | 163 | Carsten Thomassen. Hamiltonian-connected tournaments |
| 150 | -- | 155 | Melvyn B. Nathanson. Sumsets Contained in Infinite Sets of Integers |
| 156 | -- | 168 | Jerrold R. Griggs. On Chains and Sperner k-Families in Ranked Posets |
| 164 | -- | 167 | Rudolf Ahlswede. Simple hypergraphs with maximal number of adjacent pairs of edges |
| 168 | -- | 179 | Peter J. Cameron. 6-Transitive graphs |
| 169 | -- | 190 | Mireille Content, François Lemay, Pierre Leroux. Catégories de Möbius et fonctorialités: un cadre général pour I inversioin de Möbius |
| 180 | -- | 183 | Y. Alavi, M. Behzad, E. A. Nordhaus. Minimal separating sets of maximum size |
| 184 | -- | 207 | Victor Klee. Classification and enumeration of minimum (d, 3, 3)-graphs for odd d |
| 191 | -- | 218 | William T. Spears, Barbara Jeffcott, D. M. Jackson. An Algebraic Theory of Sequence Enumeration |
| 208 | -- | 236 | László Lovász. Matroid matching and some applications |
| 237 | -- | 242 | Paul D. Seymour. Packing and covering with matroid circuits |
| 243 | -- | 244 | William G. Frye, Renu Laskar. Path number of bipartite digraphs |
| 245 | -- | 248 | Rainer E. Burkard, Peter L. Hammer. A note on Hamiltonian split graphs |
| 249 | -- | 250 | James G. Oxley. On Hartfiel and Maxson s definition of connected sets of a matroid |