| 1 | -- | 0 | Ulrich Faigle, Kees Hoede. Preface |
| 3 | -- | 25 | Luitpold Babel, Gottfried Tinhofer. Hard-to-color Graphs for Connected Sequential Colorings |
| 27 | -- | 37 | Ulrike Baumann. on Edge-hamiltonian Cayley Graphs |
| 39 | -- | 46 | Hajo Broersma, Ingo Schiermeyer. Subgraphs, Closures and Hamiltonicity |
| 47 | -- | 61 | Elias Dahlhaus. A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs |
| 63 | -- | 74 | Peter Damaschke. PLA Folding in Special Graph Classes |
| 75 | -- | 83 | Peter Dankelmann. Average Distance and Independence Number |
| 85 | -- | 93 | Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon. Constructing Colorings for Diagrams |
| 95 | -- | 102 | Evelyne Flandrin, Jean-Luc Fouquet, Hao Li. Hamiltonicity of Bipartite Biclaw-free Graphs |
| 103 | -- | 105 | Jochen Harant, Hansjoachim Walther. A Lower Bound for the Shortness Coefficient of a Class of Graphs |
| 107 | -- | 111 | Xueliang Li, Fuji Zhang. Hamiltonicity of a Type of Interchange Graphs |
| 113 | -- | 116 | Jaroslav Nesetril. on ordered Graphs and Graph orderings |
| 117 | -- | 125 | Thomas Niessen. How to Find overfull Subgraphs in Graphs with Large Maximum Degree |
| 127 | -- | 135 | Frank Pfeiffer. A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs |
| 137 | -- | 146 | Werner Poguntke. on Reliable Graphs with Static Routing Plans |
| 147 | -- | 157 | Erich Prisner. Algorithms for Interval Catch Digraphs |
| 159 | -- | 170 | Alain Quilliot, Sun Xiao Chao. Algorithmic Characterizations of Interval ordered Hypergraphs and Applications |
| 171 | -- | 179 | Horst Sachs, Holger Zernitz. Remark on the Dimer Problem |
| 181 | -- | 186 | Günter Schaar. Remarks on Hamiltonian Properties of Powers of Digraphs |
| 187 | -- | 195 | Zsolt Tuza. Inequalities for Minimal Covering Sets in Set Systems of Given Rank |
| 197 | -- | 209 | Margit Voigt, Hansjoachim Walther. Chromatic Number of Prime Distance Graphs |
| 211 | -- | 217 | Lutz Volkmann. on Graphs with Equal Domination and Covering Numbers |
| 219 | -- | 232 | Angela von Arnim, Colin de la Higuera. Computing the Jump Number on Semi-orders Is Polynomial |
| 233 | -- | 241 | Mariusz Wozniak. Embedding Graphs of Small Size |