1. The generalized almost resolvable cycle system problem

   • Peter Adams
   • Elizabeth J. Billington
   • C. C. Lindner

   OriginalPaper 19 March 2011 Pages: 617 - 625

2. On properties of random dissections and triangulations

   • Nicla Bernasconi
   • Konstantinos Panagiotou
   • Angelika Steger

   OriginalPaper 19 March 2011 Pages: 627 - 654

3. Asymptotic enumeration of integer matrices with large equal row and column sums

   • E. Rodney Canfield
   • Brendan D. McKay

   OriginalPaper 19 March 2011 Pages: 655 - 680

4. The homology of a locally finite graph with ends

   • Reinhard Diestel
   • Philipp Sprüssel

   OriginalPaper 19 March 2011 Pages: 681 - 714

5. Algorithms for finding an induced cycle in planar graphs

   • Ken-ichi Kawarabayashi
   • Yusuke Kobayashi

   OriginalPaper 19 March 2011 Pages: 715 - 734

6. An asymptotic bound for the complexity of monotone graph properties

   • Torsten Korneffel
   • Eberhard Triesch

   OriginalPaper 19 March 2011 Pages: 735 - 743