1. Partitioning 2-edge-colored graphs by monochromatic paths and cycles

   • József Balogh
   • János Barát
   • Gábor N. Sárközy

   Original Paper 21 August 2014 Pages: 507 - 526

2. Triangulations of the sphere, bitrades and abelian groups

   • Simon R. Blackburn
   • Thomas A. McCourt

   Original Paper 12 June 2014 Pages: 527 - 546

3. The circumference of the square of a connected graph

   • Stephan Brandt
   • Janina Müttel
   • Dieter Rautenbach

   Original Paper 16 June 2014 Pages: 547 - 559

4. Judicious partitions of uniform hypergraphs

   • John Haslegrave

   Original Paper 16 June 2014 Pages: 561 - 572

5. Optimal covers with Hamilton cycles in random graphs

   • Dan Hefetz
   • Daniela Kühn
   • Deryk Osthus

   Original Paper 23 June 2014 Pages: 573 - 596

6. 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

   • András Sebő
   • Jens Vygen

   Original Paper 11 November 2014 Pages: 597 - 629