Journal of Combinatorial Theory, Series B, Volume 87

Volume 87, Number 1, January 2003

• Bojan Mohar, Alexander Schrijver:
  Blocking nonorientability of a surface. 2-16
  Electronic Edition (link) BibTeX
• Bill Jackson, Tibor Jordán:
  Non-separable detachments of graphs. 17-37
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  The chromatic number of a graph of girth 5 on a fixed surface. 38-71
  Electronic Edition (link) BibTeX
• Ron Aharoni, Tamás Fleiner:
  On a lemma of Scarf. 72-80
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, C. St. J. A. Nash-Williams:
  Hamiltonian double latin squares. 81-129
  Electronic Edition (link) BibTeX
• Thomas Andreae:
  On immersions of uncountable graphs. 130-137
  Electronic Edition (link) BibTeX
• Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
  2-Factor hamiltonian graphs. 138-144
  Electronic Edition (link) BibTeX
• Reinhard Diestel:
  The countable Erds-Menger conjecture with ends. 145-161
  Electronic Edition (link) BibTeX
• Dragan Marusic:
  On 2-arc-transitivity of Cayley graphs. 162-196
  Electronic Edition (link) BibTeX
• Reinhard Diestel, Daniela Kühn:
  Graph-theoretical versus topological ends of graphs. 197-206
  Electronic Edition (link) BibTeX

Volume 87, Number 2, March 2003

• Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski:
  The independence fractal of a graph. 209-230
  Electronic Edition (link) BibTeX
• Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan:
  Partitioning into graphs with only small components. 231-243
  Electronic Edition (link) BibTeX
• Guoli Ding, Zhenzhen Xu, Wenan Zang:
  Packing cycles in graphs, II. 244-253
  Electronic Edition (link) BibTeX
• Daniel P. Sanders, Yue Zhao:
  Coloring edges of graphs embedded in a surface of characteristic zero. 254-263
  Electronic Edition (link) BibTeX
• James F. Geelen, Geoffrey P. Whittle:
  Cliques in dense GF(q)-representable matroids. 264-269
  Electronic Edition (link) BibTeX
• James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle:
  Disjoint cocircuits in matroids with large rank. 270-279
  Electronic Edition (link) BibTeX
• Yusheng Li, Wenan Zang:
  Ramsey numbers involving large dense graphs and bipartite Turán numbers. 280-288
  Electronic Edition (link) BibTeX
• Stéphane Bessy, Stéphan Thomassé:
  Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. 289-299
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols:
  Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. 300-330
  Electronic Edition (link) BibTeX
• Gérard Cornuéjols, Xinming Liu:
  A class of perfect graphs containing P₆. 331-347
  Electronic Edition (link) BibTeX
• Feng Ming Dong:
  Bounds for mean colour numbers of graphs. 348-365
  Electronic Edition (link) BibTeX
• Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp:
  Graphs with large maximum degree containing no odd cycles of a given length. 366-373
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Michael Stiebitz:
  A new lower bound on the number of edges in colour-critical graphs and hypergraphs. 374-402
  Electronic Edition (link) BibTeX