1. Edge-isoperimetric inequalities in the grid

   • Béla Bollobás
   • Imre Leader

   OriginalPaper Pages: 299 - 314

2. An efficient algorithm to recognize locally equivalent graphs

   • André Bouchet

   OriginalPaper Pages: 315 - 329

3. On the second eigenvalue and random walks in randomd-regular graphs

   • Joel Friedman

   OriginalPaper Pages: 331 - 362

4. Balancing extensions via Brunn-Minkowski

   • Jeff Kahn
   • Nathan Linial

   OriginalPaper Pages: 363 - 368

5. Asymptotic enumeration by degree sequence of graphs with degreeso(n ^1/2)

   • Brendan D. McKay
   • Nicholas C. Wormald

   OriginalPaper Pages: 369 - 382

6. On computing majority by comparisons

   • Michael E. Saks
   • Michael Werman

   OriginalPaper Pages: 383 - 387

7. Contractible edges in non-separating cycles

   • Yoshimi Egawa
   • Akira Saito

   Note Pages: 389 - 392

8. Highly connected non-2-linked digraphs

   • Carsten Thomassen

   Note Pages: 393 - 395