| 455 | -- | 467 | H. L. Abbott, D. R. Hare, Bing Zhou. Large Faces in 4-Critical Planar Graphs with Minimum Degree 4 |
| 469 | -- | 474 | H. L. Abbott, Bing Zhou. Some Remarks on (::::k::::-1)-Critical Subgraphs of ::::k::::-Critical Graphs |
| 475 | -- | 480 | Rudolf Ahlswede, Péter L. Erdös, Niall Graham. A Splitting Property of Maximal Antichains |
| 481 | -- | 487 | Kris Coolsaet. Local Structure of Graphs with lambda = mu=2, alpha::2:: = 4 |
| 489 | -- | 497 | Alan M. Frieze, Bruce A. Reed. Covering the Edges of a Random Graph by Cliques |
| 499 | -- | 513 | Michel X. Goemans, V. S. Ramakrishnan. Minimizing Submodular Functions over Families of Sets |
| 515 | -- | 532 | Satoru Iwata. Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows |
| 533 | -- | 539 | Wolfgang Mader. Existence of Vertices of Local Connectivity ::::k:::: in Digraphs of Large Outdegree |
| 541 | -- | 556 | Bojan Mohar. Uniqueness and Minimality of Large Face-Width Embeddings of Graphs |
| 557 | -- | 565 | Noam Nisan, Avi Wigderson. On Rank vs. Communication Complexity |
| 567 | -- | 588 | Ran Raz, Boris Spieker. On the Log Rank -Conjecture in Communication Complexity |
| 589 | -- | 596 | Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu. Ramsey Families which Exclude a Graph |