| 97 | -- | 111 | N. M. Singhi, Iyengar Shriniwas, T. A. Antony. Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications |
| 113 | -- | 120 | Hans-Jürgen Bandelt, Victor Chepoi. Graphs of Acyclic Cubical Complexes |
| 121 | -- | 134 | Hans-Jürgen Bandelt, Victor Chepoi. Cellular Bipartite Graphs |
| 135 | -- | 142 | Peter J. Cameron. Metric and Topological Aspects of the Symmetric Group of Countable Degree |
| 143 | -- | 156 | Michel Deza, Viatcheslav P. Grishukhin. Cut Lattices and Equiangular Lines |
| 157 | -- | 160 | Michel Deza, Jirí Tuma. A Note on l::1::-rigid Planar Graphs |
| 161 | -- | 175 | Andreas W. M. Dress, Vincent Moulton, Werner F. Terhalle. T-theory: An Overview |
| 177 | -- | 189 | Dmitry Fon-Der-Flaass. A Combinatorial Construction For Twin Trees |
| 191 | -- | 208 | Michiel Hazewinkel. Tree-Tree Matrices and Other Combinatorial Problems from Taxonomy |
| 209 | -- | 221 | Wilfried Imrich, Sandi Klavzar. On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs |
| 223 | -- | 232 | Alexander V. Karzanov, Yannis Manoussakis. Minimum (2, r)-Metrics and Integer Multiflows |
| 233 | -- | 254 | Monique Laurent, Svatopluk Poljak. Gap Inequalities for the Cut Polytope |
| 255 | -- | 264 | Bruno Leclerc. Minimum Spanning Trees and Types of Dissimilarities |
| 265 | -- | 270 | Simon Litsyn, Aimo Tietäväinen. Upper Bounds on the Covering Radius of a Code with a Given Dual Distance |
| 271 | -- | 277 | Hiroshi Maehara. On sqrt(Q)-Distances |
| 279 | -- | 289 | Michel Deza, Sergey V. Shpectorov. Recognition of the::::l::::::1::-Graphs with Complexity::::O(nm), or::::Football in a Hypercube |
| 291 | -- | 307 | Maurice Pouzet, Bernard Roux. Ubiquity in Category for Metric Spaces and Transition Systems |
| 309 | -- | 316 | Marcel Wild. Consequences of the Brylawski-Lucas Theorem for Binary Matroids |
| 317 | -- | 333 | Uta Wille. Representation of Ordinal Contexts by Ordered n-Quasigroups |