1 | -- | 21 | Lars Døvling Andersen, Herbert Fleischner, Bill Jackson. Removable edges in cyclically 4-edge-connected cubic graphs |
23 | -- | 30 | Fred Buckley, Frank Harary. On the euclidean dimension of a wheel |
31 | -- | 42 | Michel Deza, N. M. Singhi. Rigid pentagons in hypercubes |
43 | -- | 47 | Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová. Embedding of trees in euclidean spaces |
49 | -- | 65 | A. Meir, J. W. Moon. Survival under random coverings of trees |
67 | -- | 73 | Alan Rahilly. Divisions of symmetric designs into two parts |
75 | -- | 85 | Sam Stueckle. On natural isomorphisms of cycle permutation graphs |
87 | -- | 94 | Paul Terwilliger. Q-polynomial association schemes |
95 | -- | 99 | Robert Chen, F. K. Hwang. Stronger players win more balanced knockout tournaments |
101 | -- | 110 | Ernest J. Cockayne, P. H. Spencer. On the independent queens covering problem |
111 | -- | 113 | Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio. k-factorization of complete bipartite graphs |
115 | -- | 206 | Zoltán Füredi. Matchings and covers in hypergraphs |
207 | -- | 217 | David Avis, Paul Erdös, János Pach. Repeated distances in space |
219 | -- | 228 | Eiichi Bannai, Tatsuro Ito. On distance-regular graphs with fixed valency, II |
229 | -- | 233 | C. D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril. The chromatic connectivity of graphs |
235 | -- | 239 | Masatosi Imori, Makoto Matsumoto, Hisao Yamada. The line digraph of a regular and pancircular digraph is also regular and pancircular |
241 | -- | 255 | Esther R. Lamken, Scott A. Vanstone. Orthogonal resolutions in odd balanced tournament designs |
257 | -- | 284 | Masataka Nakamura. Structural theorems for submodular functions, polymatroids and polymatroid intersections |
285 | -- | 295 | D. G. Rogers. Irregular, extremal perfect systems of difference sets II |
297 | -- | 301 | Mieko Yamada. t |
303 | -- | 306 | Noga Alon, Z. Bregman. Every 8-uniform 8-regular hypergraph is 2-colorable |
307 | -- | 321 | Martin Charles Golumbic. Algorithmic aspects of intersection graphs and representation hypergraphs |
323 | -- | 332 | Joseph P. S. Kung, James G. Oxley. q). II. Dowling geometries |
333 | -- | 354 | Katsuhiro Ota. The number of contractible edges in 3-connected graphs |
355 | -- | 377 | Jennifer Seberry, Albert Leon Whiteman. New Hadamard matrices and conference matrices obtained via Mathon's construction |
379 | -- | 392 | N. Srinivasan, Jaroslav Opatrny, Vangalur S. Alagar. Bigeodetic graphs |
393 | -- | 394 | László Pyber. Finding defective coins |