| 3 | -- | 9 | Rudolf Ahlswede, Zhen Zhang. On Maximal Shadows of Members in Left-compressed Sets |
| 11 | -- | 33 | Luitpold Babel, Stephan Olariu. On the p-connectedness of Graphs - A Survey |
| 35 | -- | 40 | Gunter Bär. On the Complexity of Linear Programming in the BSS-model |
| 41 | -- | 60 | Jørgen Bang-Jensen, Gregory Gutin. On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs |
| 61 | -- | 72 | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo. A New Sufficient Condition for a Digraph to Be Hamiltonian |
| 73 | -- | 81 | Frank E. Bennett. A Brief Survey of Perfect Mendelsohn Packing and Covering Designs |
| 83 | -- | 108 | Anton Betten, Dieter Betten. The Proper Linear Spaces on 17 Points |
| 109 | -- | 114 | Anton Betten, Reinhard Laue, Alfred Wassermann. Simple 8-(40, 11, 1440) Designs |
| 115 | -- | 125 | Christian Bey. The Erdos-Ko-Rado Bound for the Function Lattice |
| 127 | -- | 140 | Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder. On k-partitioning of Hamming Graphs |
| 141 | -- | 162 | Andreas Brandstädt, Van Bang Le. Tree- and Forest-perfect Graphs |
| 163 | -- | 167 | Andreas Brandstädt, Peter L. Hammer. On the Stability Number of Claw-free P::5::-free and More General Graphs |
| 169 | -- | 180 | E. Rodney Canfield, Konrad Engel. An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer |
| 181 | -- | 195 | Serafino Cicerone, Gabriele Di Stefano. On the Extension of Bipartite to Parity Graphs |
| 197 | -- | 216 | Serafino Cicerone, Gabriele Di Stefano. Graph Classes Between Parity and Distance-hereditary Graphs |
| 217 | -- | 221 | Dietmar Cieslik. The Steiner Ratio of lamda:::d:::::2k:: |
| 223 | -- | 239 | Feodor F. Dragan. Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS |
| 241 | -- | 249 | Fedor V. Fomin. Note on a Helicopter Search Problem on Graphs |
| 251 | -- | 272 | Martin Grüttmüller. On the PBD-closure of Sets Containing 3 |
| 273 | -- | 277 | Yubao Guo. Outpaths in Semicomplete Multipartite Digraphs |
| 279 | -- | 284 | Heiko Harborth, Meinhard Möller. Weakened Ramsey Numbers |
| 285 | -- | 309 | L. H. Harper. On an Isoperimetric Problem for Hamming Graphs |
| 311 | -- | 320 | Sven Hartmann. Asymptotic Results on Suborthogonal B -decompositions of Complete Digraphs |
| 321 | -- | 330 | Wilfried Imrich, Sandi Klavzar. Recognizing Graphs of Acyclic Cubical Complexes |
| 331 | -- | 359 | Dieter Jungnickel, Alexander Pott. Perfect and Almost Perfect Sequences |
| 361 | -- | 376 | Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi. On Trades: An Update |
| 377 | -- | 388 | Uwe Leck, Volker Leck. Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter |
| 389 | -- | 416 | Ali Ridha Mahjoub, Charles Nocq. On the Linear Relaxation of the 2-node Connected Subgraph Polytope |
| 417 | -- | 424 | Ingrid Mengersen, Jörg Oeckermann. Matching-star Ramsey Sets |
| 425 | -- | 437 | Kari J. Nurmela, Patric R. J. Östergård. Covering t-sets with (t+2)-sets |
| 439 | -- | 444 | Ulrike Schumacher. Suborthogonal Double Covers of the Complete Graph by Stars |
| 445 | -- | 453 | Peter Tittmann. Partitions and Network Reliability |
| 455 | -- | 466 | Annegret Wagler. Critical Edges in Perfect Line Graphs and some Polyhedral Consequences |