| 507 | -- | 526 | József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy. Partitioning 2-edge-colored graphs by monochromatic paths and cycles |
| 527 | -- | 546 | Simon R. Blackburn, Thomas A. McCourt. Triangulations of the sphere, bitrades and abelian groups |
| 547 | -- | 559 | Stephan Brandt, Janina Müttel, Dieter Rautenbach. The circumference of the square of a connected graph |
| 561 | -- | 572 | John Haslegrave. Judicious partitions of uniform hypergraphs |
| 573 | -- | 596 | Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus. Optimal covers with Hamilton cycles in random graphs |
| 597 | -- | 629 | András Sebö, Jens Vygen. Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs |