| 1 | -- | 0 | Ulrich Faigle, Kees Hoede. Preface |
| 3 | -- | 34 | Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng. Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three |
| 35 | -- | 44 | Douglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel. The Complexity of Recognizing Tough Cubic Graphs |
| 45 | -- | 61 | Hans L. Bodlaender, Dimitrios M. Thilikos. Treewidth for Graphs with Small Chordality |
| 63 | -- | 66 | Stephan Brandt. A Sufficient Condition for All Short Cycles |
| 67 | -- | 73 | Min-Jen Jou, Gerard J. Chang. Maximal Independent Sets in Graphs with at Most One Cycle |
| 75 | -- | 89 | Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller. Transversal Partitioning in Balanced Hypergraphs |
| 91 | -- | 103 | Peter Dankelmann, Henda C. Swart, Ortrud Oellermann. On the Average Steiner Distance of Graphs with Prescribed Properties |
| 105 | -- | 117 | Theo S. H. Driessen. Tree Enterprises and Bankruptcy Ventures a Game Theoretic Similarity Due to a Graph Theoretic Proof |
| 119 | -- | 125 | Yubao Guo. Spanning Local Tournaments in Locally Semicomplete Digraphs |
| 127 | -- | 135 | Yubao Guo, Lutz Volkmann. Bypaths in Tournaments |
| 137 | -- | 154 | Anuj Mehrotra. Cardinality Constrained Boolean Quadratic Polytope |
| 155 | -- | 170 | Thomas Niessen. Optimal Channel Allocation for Several Types of Cellular Radio Networks |
| 171 | -- | 188 | Andreas Parra, Petra Scheffler. Characterizations and Algorithmic Applications of Chordal Graph Embeddings |
| 189 | -- | 200 | Annette Schelten, Ingo Schiermeyer. Ramsey Numbers r(K::3::, G) for Connected Graphs G of Order Seven |
| 201 | -- | 211 | Uwe Schelten, Ingo Schiermeyer. Small Cycles in Hamiltonian Graphs |
| 213 | -- | 221 | Rainer Schrader, Georg Wambach. The Setup Polyhedron of Series-parallel Posets |
| 223 | -- | 245 | Anand Srivastav, Peter Stangier. Tight Approximations for Resource Constrained Scheduling and Bin Packing |
| 247 | -- | 256 | Zsolt Tuza, Margit Voigt. List Colorings and Reducibility |
| 257 | -- | 263 | Hansjoachim Walther. Polyhedral Graphs Without Hamiltonian Cycles |
| 265 | -- | 277 | P. Wittmann. Vertex-distinguishing Edge-colorings of 2-regular Graphs |
| 279 | -- | 284 | A. Pawel Wojda, Malgorzata Zwonek. Coloring Edges of Self-complementary Graphs |