| 1 | -- | 8 | J. H. Cho, E. M. Palmer. n, n)-tree |
| 9 | -- | 16 | Hortensia Galeana-Sánchez, Sergio Rajsbaum. Cycle-pancyclism in tournaments II |
| 17 | -- | 22 | Wayne Goddard. The toughness of cubic graphs |
| 23 | -- | 37 | Akira Hiraki. k - 2, 1) in the intersection array of a distance-regular graph |
| 39 | -- | 54 | Haruo Ishibashi. The Terwilliger algebras of certain association schemes over the Galois rings of characteristic 4 |
| 55 | -- | 58 | Ryuzaburo Noda. An inequality for steiner systems II |
| 59 | -- | 68 | Talmage James Reid. On fixing edges in graph minors |
| 69 | -- | 80 | Andrew Vince, Yongzhi Yang. Reconstruction of the set of branches of a graph |
| 81 | -- | 93 | Dominique de Werra, Jacques Erschler. Open shop scheduling with some additional constraints |
| 97 | -- | 137 | Rudolf Ahlswede, Levon H. Khachatrian. Optimal pairs of incomparable clouds in multisets |
| 139 | -- | 147 | David W. Barnette. Generating the centrally symmetric 3-polyhedral graphs |
| 149 | -- | 161 | Tom C. Brown, Bruce M. Landman. The Ramsey property for collections of sequences not containing all arithmetic progressions |
| 163 | -- | 178 | Italo J. Dejter. k + 1 and their structure graphs |
| 179 | -- | 187 | Qiongxiang Huang, Jixiang Meng. On the isomorphisms and automorphism groups of circulants |
| 189 | -- | 198 | Seiya Negami, Katsuhiro Ota. Polynomial invariants of graphs II |
| 199 | -- | 207 | Tiong Seng Tay. Some results on generalized Latin Squares |
| 209 | -- | 219 | Armen S. Asratian, G. V. Sarkisian. Some panconnected and pancyclic properties of graphs with a local ore-type condition |
| 221 | -- | 230 | F. M. Dong, Y. P. Liu. W(n, n - 2, k) |
| 231 | -- | 237 | Jan van den Heuvel. Extensions and consequences of Chvátal-Erdős' theorem |
| 239 | -- | 251 | Jin Ho Kwak, Jaeun Lee, Moo Young Sohn. Isoperimetric numbers of graph bundles |
| 253 | -- | 266 | Francis Maurin. Incomplete orthogonal arrays and idempotent orthogonal arrays |
| 267 | -- | 281 | Fred R. McMorris, Chi Wang. Modular intersection graphs |
| 283 | -- | 293 | Thomas Meixner, Antonio Pasini. A family of multiply extended grids |
| 295 | -- | 303 | Michael Reid. On the connectivity of unit distance graphs |
| 305 | -- | 320 | Dalibor Froncek. Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters |
| 321 | -- | 326 | Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma. A finiteness theorem for maximal independent sets |
| 327 | -- | 331 | P. Katerinis, N. Tsikopoulos. Perfect matchings in regular bipartite graphs |
| 333 | -- | 339 | K. M. Koh, B. P. Tan. The minimum diameter of orientations of complete multipartite graphs |
| 341 | -- | 344 | Hiroshi Maehara, Norihide Tokushige. A spatial unit-bar-framework which is rigid and triangle-free |
| 345 | -- | 360 | Yannis Manoussakis, M. Spyratos, Zsolt Tuza, Margit Voigt. Minimal colorings for properly colored subgraphs |
| 361 | -- | 371 | Ladislav Stacho. Maximally non-hamiltonian graphs of girth 7 |
| 373 | -- | 384 | Hong Wang. On long cycles in a 2-connected bipartite graph |
| 385 | -- | 395 | Bing Wei. Hamiltonian cycles in 1-tough graphs |