209 | -- | 216 | József Beck. Balancing families of integer sequences |
217 | -- | 224 | C. Berge, C. C. Chen, Vasek Chvátal, C. S. Seow. Combinatorial properties of polyominoes |
225 | -- | 231 | Michel Deza, Peter Frankl. Every large set of equidistant (0, +1, -1)-vectors forms a sunflower |
233 | -- | 241 | Zoltán Füredi, János Komlós. The eigenvalues of random symmetric matrices |
243 | -- | 256 | C. D. Godsil. On the full automorphism group of a graph |
257 | -- | 262 | C. D. Godsil. Hermite polynomials and a duality relation for matchings polynomials |
263 | -- | 273 | Ervin Györi. Partition conditions and vertex-connectivity of graphs |
275 | -- | 284 | Peter L. Hammer, Bruno Simeone. The splittance of a graph |
285 | -- | 288 | Heinz Adolf Jung. A note on fragments of infinite graphs |
289 | -- | 301 | Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates. The existence of Howell designs of side n+1 and order 2n |
303 | -- | 307 | Joel Spencer. Extremal problems, partition theorems, symmetric hypergraphs |
309 | -- | 312 | Richard Weiss. The nonexistence of 8-transitive graphs |