| 1 | -- | 6 | Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson. Goodness of trees for generalized books |
| 7 | -- | 23 | Dragos Cvetkovic, Peter Rowlinson. Spectra of unicyclic graphs |
| 25 | -- | 38 | H. Enomoto, P. Frankl, N. Ito, K. Nomura. Codes with given distances |
| 39 | -- | 43 | Chris D. Godsil, Wilfried Imrich. Embedding graphs in Cayley graphs |
| 45 | -- | 53 | Frank Harary, Josef Lauri. The class reconstruction number of maximal planar graphs |
| 55 | -- | 66 | Richard P. Stanley. On the number of faces of centrally-symmetric simplicial polytopes |
| 67 | -- | 73 | Miroslaw Truszczynski, Zsolt Tuza. Linear upper bounds for local Ramsey numbers |
| 75 | -- | 80 | Zsolt Tuza. Inequalities for two set systems with prescribed intersections |
| 81 | -- | 89 | Mitsuo Yoshizawa. k, q, t) |
| 91 | -- | 94 | Noga Alon, Zoltán Füredi. On the kernel of intersecting families |
| 95 | -- | 109 | Eiichi Bannai, Tatsuro Ito. On distance-regular graphs with fixed valency |
| 111 | -- | 126 | Fan R. K. Chung, Peter Frankl. The maximum number of edges in a 3-graph not containing a given star |
| 127 | -- | 139 | Vasek Chvátal, Najiba Sbihi. Bull-free Berge graphs are perfect |
| 141 | -- | 143 | Dieter Jungnickel. On a theorem of Ganley |
| 145 | -- | 158 | Igor Kríz. Large independent sets in shift-invariant graphs - Solution of Bergelson's problem |
| 159 | -- | 189 | Haruko Okamura. k paths |
| 191 | -- | 199 | Svatopluk Poljak, Zsolt Tuza. Maximum bipartite subgraphs of Kneser graphs |
| 201 | -- | 202 | Jin Akiyama, Mamoru Watanabe. Maximum induced forests of planar graphs |
| 203 | -- | 211 | Noga Alon, Jeff Kahn, Paul D. Seymour. Large induced degenerate subgraphs |
| 213 | -- | 219 | Janet Simpson Beissinger, Uri N. Peled. Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials |
| 221 | -- | 225 | Vasanti N. Bhat-Nayak, N. Ito, Anjana Wirmani-Prasad. Some New Hadamard matrices |
| 227 | -- | 238 | Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz. n-cyclic digraphs |
| 239 | -- | 250 | Pierre Fraisse, Carsten Thomassen. Hamiltonian dicycles avoiding prescribed arcs in tournaments |
| 251 | -- | 254 | Zoltán Füredi. The maximum number of balancing sets |
| 255 | -- | 265 | John Gimbel, H. Joseph Straight. Some topics in cochromatic theory |
| 267 | -- | 277 | András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza. Ramsey numbers for local colorings |
| 279 | -- | 284 | Katherine Heinrich, Pavol Hell. On the problem of bandsize |
| 285 | -- | 291 | Ortrud R. Oellermann. l-connectivity of a graph |
| 293 | -- | 298 | Paul Terwilliger, Michel Deza. The classification of finite connected hypermetric spaces |
| 299 | -- | 311 | Robert E. L. Aldred, Derek A. Holton. Cycles through five edges in 3-connected cubic graphs |
| 313 | -- | 324 | Neal Brand, W. Cary Huffman. Mendelsohn designs admitting the affine group |
| 325 | -- | 339 | Marie-Pierre Delest, Dominique Gouyou-Beauchamps, Bernard Vauquelin. Enumeration of parallelogram polyominoes with given bond and site perimeter |
| 341 | -- | 347 | Peter Frankl, Zoltán Füredi, János Pach. Bounding one-way differences |
| 349 | -- | 356 | Nora Hartsfield. The splitting number of the complete graph in the projective plane |
| 357 | -- | 363 | S. R. Jayaram. Line domination in graphs |
| 365 | -- | 377 | Ronald C. Mullin, Douglas R. Stinson. t + 1 |
| 379 | -- | 382 | András Recski. Elementary strong maps of graphic matroids |
| 383 | -- | 393 | J. M. S. Simões-Pereira. Underlying graph and total length of optimal realizations of variable distance matrices |