1. Uniform cyclic edge connectivity in cubic graphs

   • R. E. L. Aldred
   • D. A. Holton
   • Bill Jackson

   OriginalPaper Pages: 81 - 96

2. Parallel comparison algorithms for approximation problems

   • N. Alon
   • Y. Azar

   OriginalPaper Pages: 97 - 122

3. Trees in tournaments

   • Roland Häggkvist
   • Andrew Thomason

   OriginalPaper Pages: 123 - 130

4. An Ω(n ^4/3) lower bound on the randomized complexity of graph properties

   • Péter Hajnal

   OriginalPaper Pages: 131 - 143

5. Clean triangulations

   • Nora Hartsfield
   • Gerhard Ringel

   OriginalPaper Pages: 145 - 155

6. On the power of white pebbles

   • Bala Kalyanasundaram
   • Georg Schnitger

   OriginalPaper Pages: 157 - 171

7. On claws belonging to every tournament

   • Xiaoyun Lu

   OriginalPaper Pages: 173 - 179

8. Effective on-line coloring ofP ₅-free graphs

   • András Gyárfás
   • Jenő Lehel

   Note Pages: 181 - 184