Combinatorica, Volume 27

Volume 27, Number 1, February 2007

• Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
  Vertex-Colouring Edge-Weightings. 1-12
  
• Noga Alon, Eyal Lubetzky:
  Codes And Xor Graph Products. 13-33
  
• András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
  Three-Color Ramsey Numbers For Paths. 35-69
  
• Lap Chi Lau:
  An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. 71-90
  
• Mikkel Thorup:
  Fully-Dynamic Min-Cut. 91-127
  
• Eric Jaligot:
  On Stabilizers Of Some Moieties Of The Random Tournament. 129-133
  

Volume 27, Number 2, March 2007

• Etienne Birmelé, John Adrian Bondy, Bruce A. Reed:
  The Erdös-Pósa Property For Long Circuits. 135-145
  
• Péter L. Erdös, Lajos Soukup:
  How To Split Antichains In Infinite Posets. 147-161
  
• Dina Ghinelli, Dieter Jungnickel:
  A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4. 163-166
  
• Shuji Isobe, Xiao Zhou, Takao Nishizeki:
  Total Colorings Of Degenerate Graphs. 167-182
  
• Colin McDiarmid:
  On The Span Of A Random Channel Assignment Problem. 183-203
  
• Jiri Sgall, Gerhard J. Woeginger:
  An Approximation Scheme For Cake Division With A Linear Number Of Cuts. 205-211
  
• Amnon Ta-Shma, Christopher Umans, David Zuckerman:
  Lossless Condensers, Unbalanced Expanders, And Extractors. 213-240
  
• Carsten Thomassen:
  On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. 241-243
  
• Hong-Jian Lai, Rui Xu, Cun-Quan Zhang:
  On Circular Flows Of Graphs. 245-246
  
• Gyula Pap:
  Packing Non-Returning A-Paths. 247-251