Journal of Graph Theory, Volume 59

Volume 59, Number 1, September 2008

• Tomás Kaiser:
  Disjoint T-paths in tough graphs. 1-10
  
• Robert Lukot'ka, Martin Skoviera:
  Real flow number and the cycle rank of a graph. 11-16
  
• Maria Chudnovsky, Alexandra Ovetsky Fradkin:
  Hadwiger's conjecture for quasi-line graphs. 17-33
  
• Paul Dorbec, Sylvain Gravier, Gábor N. Sárközy:
  Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs. 34-44
  
• Andreja Ilic, Dragan Masulovic, Uros Rajkovic:
  Finite homomorphism-homogeneous tournaments with loops. 45-58
  
• Joan P. Hutchinson:
  On list-coloring outerplanar graphs. 59-74
  
• Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow:
  Inequalities for the first-fit chromatic number. 75-88
  

Volume 59, Number 2, October 2008

• Ján Mazák:
  Circular chromatic index of type 1 Blanusa snarks. 89-96
  
• Mark H. Siggers:
  On highly ramsey infinite graphs. 97-114
  
• Antoine Vella, R. Bruce Richter:
  Cycle spaces in topological spaces. 115-144
  
• Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto:
  An improved upper bound on the crossing number of the hypercube. 145-161
  
• Karel Casteels, R. Bruce Richter:
  The bond and cycle spaces of an infinite graph. 162-176
  

Volume 59, Number 3, November 2008

• Ron Aharoni, Eli Berger, Ori Kfir:
  Acyclic systems of representatives and acyclic colorings of digraphs. 177-189
  
• Serguei Norine, Tsai-Lien Wong, Xuding Zhu:
  Circular choosability via combinatorial Nullstellensatz. 190-204
  
• János Pach, Micha Sharir:
  On planar intersection graphs with forbidden subgraphs. 205-214
  
• Andrew D. King, Bruce A. Reed:
  Bounding chi in terms of omega and delta for quasi-line graphs. 215-228
  
• Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
  List colorings with measurable sets. 229-238
  
• Yoshimi Egawa:
  k-shredders in k-connected graphs. 239-259
  

Volume 59, Number 4, December 2008

• Xuding Zhu:
  Game coloring the Cartesian product of graphs. 261-278
  
• Andrey A. Dobrynin, Leonid S. Melnikov:
  Infinite families of 4-chromatic Grötzsch-Sachs graphs. 279-292
  
• Vojtech Rödl, Jan Zich:
  Triangulations and the Hajós conjecture. 293-325
  
• Michael A. Henning, Anders Yeo:
  Hypergraphs with large transversal number and with edge sizes at least 3. 326-348