| 97 | -- | 100 | Ciping Chen. b ]-Factors |
| 101 | -- | 104 | Charles Delorme, Yahya Ould Hamidoune. On products of sets in groups |
| 105 | -- | 121 | Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi. Different capacities of a digraph |
| 123 | -- | 131 | Zhicheng Gao, Nicholas C. Wormald. Spanning eulerian subgraphs of bounded degree in triangulations |
| 133 | -- | 138 | Takayuki Hibi. Cohen-Macaulay type of the face poset of a plane graph |
| 139 | -- | 144 | K. Kayathri. On the size of Edge-Chromatic critical graphs |
| 145 | -- | 157 | Emanuel Knill. Families of sets with locally bounded width |
| 159 | -- | 168 | Jan Kratochvíl, Zsolt Tuza. Intersection Dimensions of Graph Classes |
| 169 | -- | 178 | MingChu Li. Two edge-disjoint hamiltonian cycles in graphs |
| 179 | -- | 184 | Frédéric Maffray, Myriam Preissmann. 5 |
| 185 | -- | 191 | Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Ken-ichi Shinoda. On automorphism groups of some PCS graphs |
| 193 | -- | 203 | Van Bang Le, Erich Prisner. k-line graphs |
| 205 | -- | 206 | András Recski. Elementary strong maps of graphic matroids, II |
| 207 | -- | 0 | K. T. Arasu, Dieter Jungnickel, Alexander Pott. Erratum |
| 209 | -- | 213 | Jayaram Bhasker, Tariq Samad, Douglas B. West. Size, chromatic number, and connectivity |
| 215 | -- | 224 | Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán. Anti-mitre steiner triple systems |
| 225 | -- | 230 | Gregory Gutin. Minimizing and maximizing the diameter in orientations of graphs |
| 231 | -- | 234 | Matús Harminc, Jaroslav Ivanco. Note on eccentricities in tournaments |
| 235 | -- | 240 | Tayuan Huang. k, k ≤ 6 |
| 241 | -- | 248 | Shiow-Fen Hwang, Gerard J. Chang. Edge domatic numbers of complete n- partite graphs |
| 249 | -- | 253 | Hong-Jian Lai. Every 4-Connected Line Graph of a Planar Graph is Hamiltonian |
| 255 | -- | 262 | Michel Deza, Hiroshi Maehara. A few applications of negative- type inequalities |
| 263 | -- | 268 | Frédéric Maire. Slightly triangulated graphs are perfect |
| 269 | -- | 270 | K. S. Parvathy, A. Remadevi, A. Vijayakumar. About a conjecture on the centers of chordal graphs |
| 271 | -- | 281 | Hong Wang. Independent cycles with limited size in a graph |
| 283 | -- | 292 | M. Watanabe, Peter Frankl. Some best possible bounds concerning the traces of finite sets |
| 293 | -- | 304 | Qing Xiang. Some results on multipliers and numerical multiplier groups of difference sets |
| 305 | -- | 310 | S. Arumugam, C. Pakkiam. Graphoidal bipartite graphs |
| 311 | -- | 321 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks. Protecting convex sets |
| 323 | -- | 328 | Guoli Ding. 4-structure of a tree |
| 329 | -- | 336 | Hortensia Galeana-Sánchez, Victor Neumann-Lara. New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs |
| 337 | -- | 352 | Alexander K. Kelmans. On Edge Semi-Isomorphisms and Semi-Dualities of Graphs |
| 353 | -- | 361 | Jenö Lehel. Neighbourhood-Perfect Line Graphs |
| 363 | -- | 366 | Victor Neumann-Lara. A Short Proof of a Theorem of Reid and Parker on Tournaments |
| 367 | -- | 376 | Adolfo Sánchez-Flores. On Tournaments and Their Largest Transitive Subtournaments |
| 377 | -- | 382 | Conrad Johann Swanepoel, Lourens M. Pretorius. Upper Bounds for a Ramsey Theorem for Trees |
| 383 | -- | 388 | G. R. Vijayakumar. 8 |
| 389 | -- | 396 | Igor E. Zverovich, Vadim E. Zverovich. Disproof of a Conjecture in the Domination Theory |