Journal of Combinatorial Theory, Series B, Volume 86

Volume 86, Number 1, September 2002

• Dan Archdeacon, C. Paul Bonnington, R. Bruce Richter, Jozef Sirán:
  Sewing Ribbons on Graphs in Space. 1-26
  Electronic Edition (link) BibTeX
• Bruce A. Reed, Benny Sudakov:
  Asymptotically the List Colouring Constants Are 1. 27-37
  Electronic Edition (link) BibTeX
• Yan-Quan Feng, Yan-Pei Liu, Ming Yao Xu:
  On the Isomorphisms of Cayley Graphs of Abelian Groups. 38-53
  Electronic Edition (link) BibTeX
• Daniel R. L. Brown, David M. Jackson:
  The Quadrangulation Conjecture for Orientable Surfaces. 54-79
  Electronic Edition (link) BibTeX
• Guantao Chen, Xingxing Yu:
  Long Cycles in 3-Connected Graphs. 80-99
  Electronic Edition (link) BibTeX
• Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena:
  Nilpotent Families of Endomorphisms of (p(V)+, cup). 100-108
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  Circular Colouring and Orientation of Graphs. 109-113
  Electronic Edition (link) BibTeX
• Manoel Lemos:
  On the Connectivity Function of a Binary Matroid. 114-132
  Electronic Edition (link) BibTeX
• Thomas Böhme, John Maharry, Bojan Mohar:
  K_{a, k} Minors in Graphs of Bounded Tree-Width. 133-147
  Electronic Edition (link) BibTeX
• Rhiannon Hall, James G. Oxley, Charles Semple, Geoffrey P. Whittle:
  On Matroids of Branch-Width Three. 148-171
  Electronic Edition (link) BibTeX
• Hao Li:
  On a Conjecture of Woodall. 172-185
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik, Heinz-Jürgen Voss:
  Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. 186-211
  Electronic Edition (link) BibTeX

Volume 86, Number 2, November 2002

• Shlomo Hoory:
  The Size of Bipartite Graphs with a Given Girth. 215-220
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  Another Proof of the Map Color Theorem for Nonorientable Surfaces. 221-253
  Electronic Edition (link) BibTeX
• Jean-Xavier Rampon, Bernd S. W. Schröder:
  Reconstruction of Finite Truncated Semi-Modular Lattices. 254-272
  Electronic Edition (link) BibTeX
• Bertrand Guenin:
  A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. 273-279
  Electronic Edition (link) BibTeX
• James F. Geelen, Bertrand Guenin:
  Packing Odd Circuits in Eulerian Graphs. 280-295
  Electronic Edition (link) BibTeX
• Wolfgang Mader:
  On k-con-Critically n-Connected Graphs. 296-314
  Electronic Edition (link) BibTeX
• James F. Geelen, Geoffrey P. Whittle:
  Branch-Width and Rota's Conjecture. 315-330
  Electronic Edition (link) BibTeX
• Zdenek Ryjácek:
  Closure and Forbidden Pairs for Hamiltonicity. 331-346
  Electronic Edition (link) BibTeX
• Dragos Cvetkovic, Mirko Lepovic, Peter Rowlinson, Slobodan K. Simic:
  The Maximal Exceptional Graphs. 347-363
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Topological Minors in Graphs of Large Girth. 364-380
  Electronic Edition (link) BibTeX
• Guoli Ding, Wenan Zang:
  Packing Cycles in Graphs. 381-407
  Electronic Edition (link) BibTeX
• Daniel P. Sanders, Yue Zhao:
  On the Size of Edge Chromatic Critical Graphs. 408-412
  Electronic Edition (link) BibTeX
• Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
  Ramsey Properties of Families of Graphs. 413-419
  Electronic Edition (link) BibTeX