| 111 | -- | 118 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak. Spanning caterpllars with bounded diameter |
| 119 | -- | 145 | C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg. Efficient algorithms for minimal disjoint path problems on chordal graphs |
| 147 | -- | 166 | C. P. Gopalakrishnan, C. Pandu Rangan. A linear algorithms for the two paths problem on permutation graphs |
| 167 | -- | 177 | Ralph J. Faudree, Zsolt Tuza. Stronger bounds for generalized degress and Menger path systems |
| 179 | -- | 184 | Zdenek Ryjácek, Ingo Schiermeyer. The flower conjecture in special classes of graphs |
| 185 | -- | 193 | Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Peter Mihók. Generalized list colourings of graphs |
| 195 | -- | 203 | Peter Mihók, Roman Vasky. On the factorization of reducible properties of graphs into irreducible factors |
| 205 | -- | 216 | Bert Hartnell, Douglas F. Rall. Vizing's conjecture and the one-half argument |