Cycles through ten vertices in 3-connected cubic graphs M. N. EllinghamD. A. HoltonC. H. C. Little OriginalPaper Pages: 265 - 273
Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” M. GrötschelL. LovászA. Schrijver OriginalPaper Pages: 291 - 295
A topological approach to evasiveness Jeff KahnMichael SaksDean Sturtevant OriginalPaper Pages: 297 - 306
Lower bound of the hadwiger number of graphs by their average degree A. V. Kostochka OriginalPaper Pages: 307 - 316
On equidistant binary codes of lengthn=4k+1 with distanced=2k J. H. van Lint OriginalPaper Pages: 321 - 323
Automorphisms of random graphs with specified vertices B. D. McKayN. C. Wormald OriginalPaper Pages: 325 - 338
The reconstruction problem for certain infinite graphs Michael v. Rimscha OriginalPaper Pages: 339 - 343
On combinatorial properties of spheres in euclidean spaces Vojtěch Rödl OriginalPaper Pages: 345 - 349
On automorphisms of infinite graphs with forbidden subgraphs Norbert Seifter OriginalPaper Pages: 351 - 356
The equivalence of certain equidistant binary codes and symmetric bibds D. R. StinsonG. H. J. van Rees OriginalPaper Pages: 357 - 362