Journal of Combinatorial Theory, Series B, Volume 45

Volume 45, Number 1, August 1988

• Alain Hertz:
  Bipartable graphs. 1-12
  Electronic Edition (link) BibTeX
• H. L. Abbott, Meir Katchalski:
  On the snake in the box problem. 13-24
  Electronic Edition (link) BibTeX
• Paul D. Seymour:
  On the connectivity function of a matroid. 25-30
  Electronic Edition (link) BibTeX
• Nathan Linial, Roy Meshulam, Michael Tarsi:
  Matroidal bijections between graphs. 31-44
  Electronic Edition (link) BibTeX
• Wolfgang Mader:
  Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen. 45-57
  Electronic Edition (link) BibTeX
• André Bouchet:
  Graphic presentations of isotropic systems. 58-76
  Electronic Edition (link) BibTeX
• Wenceslas Fernandez de la Vega:
  Trees in sparse random graphs. 77-85
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
  How to make a graph bipartite. 86-98
  Electronic Edition (link) BibTeX
• Edward F. Schmeichel, S. Louis Hakimi:
  A cycle structure theorem for hamiltonian graphs. 99-107
  Electronic Edition (link) BibTeX
• Shen Minggang:
  On monochromatic paths in m-coloured tournaments. 108-111
  Electronic Edition (link) BibTeX
• Alon Nilli:
  The average size of an independent set in graphs with a given chromatic number. 112-114
  Electronic Edition (link) BibTeX
• Harry Lakser, N. S. Mendelsohn, John W. Moon:
  Amalgamation of team tournaments. 115-119
  Electronic Edition (link) BibTeX
• Charles Laywine, J. P. Mayberry:
  A simple construction giving the two non-isomorphic triangle-free 3-colored K₁₆'s. 120-124
  Electronic Edition (link) BibTeX

Volume 45, Number 2, October 1988

• Robert E. L. Aldred, Chris D. Godsil:
  Distance-regular antipodai covering graphs. 127-134
  Electronic Edition (link) BibTeX
• Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed:
  Edge-colouring random graphs. 135-149
  Electronic Edition (link) BibTeX
• Stephan Olariu:
  All variations on perfectly orderable graphs. 150-159
  Electronic Edition (link) BibTeX
• Wolfgang Schmidt:
  A characterization of undirected branching greedoids. 160-184
  Electronic Edition (link) BibTeX
• Gérard Cornuéjols:
  General factors of graphs. 185-198
  Electronic Edition (link) BibTeX
• Paul A. Catlin:
  Graph homomorphisms into the five-cycle. 199-211
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. VII. Disjoint paths on a surface. 212-254
  Electronic Edition (link) BibTeX
• Stephan Olariu:
  No antitwins in minimal imperfect graphs. 255-257
  Electronic Edition (link) BibTeX

Volume 45, Number 3, December 1988

• Klaus Truemper:
  A decomposition theory for matroids IV. Decomposition of graphs. 259-292
  Electronic Edition (link) BibTeX
• J. Richard Büchi, William E. Fenton:
  Large convex sets in oriented matroids. 293-304
  Electronic Edition (link) BibTeX
• Derek A. Holton, Brendan D. McKay:
  The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. 305-319
  Electronic Edition (link) BibTeX
• Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra:
  On randomized stopping points and perfect graphs. 320-344
  Electronic Edition (link) BibTeX
• Haruko Okamura:
  Paths in k-edge-connected graphs. 345-355
  Electronic Edition (link) BibTeX
• Norbert Seifter:
  Nilpotent groups and transitive graphs. 356-366
  Electronic Edition (link) BibTeX
• Michel Las Vergnas:
  On the evaluation at (3, 3) of the Tutte polynomial of a graph. 367-372
  Electronic Edition (link) BibTeX
• Tian Feng:
  A short proof of a theorem about the circumference of a graph. 373-375
  Electronic Edition (link) BibTeX