Optimal strong parity edge-coloring of complete graphs David P. BundeKevin MilansHehui Wu Original Paper 15 May 2009 Pages: 625 - 632
Points surrounding the origin Andreas F. HolmsenJános PachHelge Tverberg Original Paper 19 August 2008 Pages: 633 - 644
On the rigidity of molecular graphs Bill JacksonTibor Jordán Original Paper 15 May 2009 Pages: 645 - 658
Counting canonical partitions in the random graph Jean A. Larson Original Paper 15 May 2009 Pages: 659 - 678
The parity problem of polymatroids without double circuits Márton MakaiJácint Szabó Original Paper 15 May 2009 Pages: 679 - 692
When does the giant component bring unsatisfiability? Michael Molloy Original Paper 15 May 2009 Pages: 693 - 734
Quasi-randomness and the distribution of copies of a fixed graph Asaf Shapira Original Paper 15 May 2009 Pages: 735 - 745