| 791 | -- | 805 | Noga Alon, Asaf Shapira. A Characterization of Easily Testable Induced Subgraphs |
| 807 | -- | 814 | Mathias Beiglböck. A Multidimensional Central Sets Theorem |
| 815 | -- | 822 | Joshua N. Cooper, Joel Spencer. Simulating a Random Walk with Constant Error |
| 823 | -- | 834 | Gianluca De Marco, Andrzej Pelc. Randomized Algorithms for Determining the Majority on Graphs |
| 835 | -- | 854 | Joanna A. Ellis-Monaghan, Lorenzo Traldi. Parametrized Tutte Polynomials of Graphs and Matroids |
| 855 | -- | 876 | Stasys Jukna. On Graph Complexity |
| 877 | -- | 893 | Bojan Mohar, Andrej Vodopivec. On Polyhedral Embeddings of Cubic Graphs |
| 895 | -- | 902 | Vladimir Nikiforov. Edge Distribution of Graphs with Few Copies of a Given Graph |
| 903 | -- | 926 | Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem. Size and Weight of Shortest Path Trees with Exponential Link Weights |
| 927 | -- | 932 | Paul Wollan. Extremal Functions for Shortening Sets of Paths |
| 933 | -- | 937 | Noga Alon. Splitting digraphs |
| 939 | -- | 941 | Bojan Mohar. Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004 |
| 941 | -- | 942 | Imre Bárány. Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004 |