| 3 | -- | 12 | Claudio Arbib, Michele Flammini. On the upper chromatic number of (v::3::, b::2::)-configurations |
| 13 | -- | 23 | Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel. Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion |
| 25 | -- | 33 | Stephan Brandt. Triangle-free graphs and forbidden subgraphs |
| 35 | -- | 43 | Hajo Broersma, Liming Xiong. A note on minimum degree conditions for supereulerian graphs |
| 45 | -- | 53 | Hajo Broersma, Xueliang Li. Some approaches to a conjecture on short cycles in digraphs |
| 55 | -- | 60 | Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh. k-Subdomination in graphs |
| 61 | -- | 71 | Janka Chlebíková. The structure of obstructions to treewidth and pathwidth |
| 73 | -- | 90 | Giuseppe Confessore, Paolo Dell Olmo, Stefano Giordani. An approximation result for the interval coloring problem on claw-free chordal graphs |
| 91 | -- | 95 | Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter. A note on transitive orientations with maximum sets of sources and sinks |
| 97 | -- | 107 | Miranca Fischermann, Lutz Volkmann. Graphs having distance-n domination number half their order |
| 109 | -- | 116 | Yubao Guo, Jin Ho Kwak. The cycle structure of regular multipartite tournaments |
| 117 | -- | 140 | Thomas Harmuth. An inductive definition of cubic toroidal maps |
| 141 | -- | 157 | . On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem |
| 159 | -- | 164 | Masataka Nakamura. A single-element extension of antimatroids |
| 165 | -- | 195 | Stavros D. Nikolopoulos. Coloring permutation graphs in parallel |
| 197 | -- | 207 | Patric R. J. Östergård. A fast algorithm for the maximum clique problem |
| 209 | -- | 217 | Artem V. Pyatkin. The incidentor coloring of multigraphs and its applications |
| 219 | -- | 237 | Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann. Vertex pancyclic graphs |
| 239 | -- | 249 | Meike Tewes. Pancyclic orderings of in-tournaments |
| 251 | -- | 261 | Hein van der Holst, José Coelho de Pina. Length-bounded disjoint paths in planar graphs |
| 263 | -- | 274 | Hansjoachim Walther. Polyhedral graphs with extreme numbers of types of faces |
| 275 | -- | 302 | Blaz Zmazek, Janez Zerovnik. Algorithm for recognizing Cartesian graph bundles |