| 209 | -- | 230 | Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski. The independence fractal of a graph |
| 231 | -- | 243 | Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan. Partitioning into graphs with only small components |
| 244 | -- | 253 | Guoli Ding, Zhenzhen Xu, Wenan Zang. Packing cycles in graphs, II |
| 247 | -- | 272 | Joseph A. Thas. Generalized Quadrangles of Order (s, s:::2:::), III |
| 254 | -- | 263 | Daniel P. Sanders, Yue Zhao. Coloring edges of graphs embedded in a surface of characteristic zero |
| 264 | -- | 269 | James F. Geelen, Geoffrey P. Whittle. Cliques in dense GF(q)-representable matroids |
| 270 | -- | 279 | James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle. Disjoint cocircuits in matroids with large rank |
| 273 | -- | 286 | Jacek R. Jachymski, Bernd S. W. Schröder, James D. Stein Jr.: A Connection between Fixed-Point Theorems and Tiling Problems |
| 280 | -- | 288 | Yusheng Li, Wenan Zang. Ramsey numbers involving large dense graphs and bipartite Turán numbers |
| 287 | -- | 332 | Edward E. Allen. Some Graded Representations of the Complex Reflection Groups |
| 289 | -- | 299 | Stéphane Bessy, Stéphan Thomassé. Every strong digraph has a spanning strong subgraph with at most ::::n::::+2 alpha-2 arcs |
| 300 | -- | 330 | Michele Conforti, Gérard Cornuéjols. Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs |
| 331 | -- | 347 | Gérard Cornuéjols, Xinming Liu. A class of perfect graphs containing ::::P::::::6:: |
| 333 | -- | 346 | Cai Heng Li. Isomorphisms of Finite Cayley Digraphs of Bounded Valency, II |
| 347 | -- | 356 | James Gary Propp, Richard Stanley. Domino Tilings with Barriers |
| 348 | -- | 365 | Feng Ming Dong. Bounds for mean colour numbers of graphs |
| 357 | -- | 378 | Leo Storme. On the Largest Caps Contained in the Klein Quadric of PG(5, q), q Odd |
| 366 | -- | 373 | Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp. Graphs with large maximum degree containing no odd cycles of a given length |
| 374 | -- | 402 | Alexandr V. Kostochka, Michael Stiebitz. A new lower bound on the number of edges in colour-critical graphs and hypergraphs |
| 379 | -- | 380 | Alex D. Scott. Another Simple Proof of a Theorem of Milner |
| 381 | -- | 389 | Fan R. K. Chung, Linyuan Lu. An Upper Bound for the Turán Number t3(n,4) |
| 390 | -- | 397 | Jason E. Fulman. Descent Identities, Hessenberg Varieties, and the Weil Conjectures |
| 398 | -- | 403 | Jeff Kahn, Alexander Lawrenz. Generalized Rank Functions and an Entropy Argument |