Journal of Combinatorial Theory, Series B, Volume 23

Volume 23, Number 1, August 1977

• H. J. Ryser:
  D. Ray Fulkerson 1924-1976. 1-2
  Electronic Edition (link) BibTeX
• Alan J. Hoffman, D. E. Schwartz:
  On partitions of a partially ordered set. 3-13
  Electronic Edition (link) BibTeX
• Jeremy Dawson:
  Balanced sets and circuits in a transversal space. 14-23
  Electronic Edition (link) BibTeX
• Richard Rado:
  Weak versions of Ramsey's theorem. 24-32
  Electronic Edition (link) BibTeX
• Robert G. Bland:
  A combinatorial abstraction of linear programming. 33-57
  Electronic Edition (link) BibTeX
• Richard A. Brualdi:
  Convex polytopes of permutation invariant doubly stochastic matrices. 58-67
  Electronic Edition (link) BibTeX
• Joel Spencer:
  Balancing games. 68-74
  Electronic Edition (link) BibTeX
• Dominique de Werra:
  Multigraphs with quasiweak odd cycles. 75-82
  Electronic Edition (link) BibTeX
• Victor Klee, Howard Quaife:
  Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs. 83-93
  Electronic Edition (link) BibTeX
• Elefterie Olaru:
  Zur Theorie der perfekten Graphen. 94-105
  Electronic Edition (link) BibTeX
• Louis Weinberg:
  Matroids, generalized networks, and electric network synthesis. 106-126
  Electronic Edition (link) BibTeX
• László Lovász, Michael D. Plummer:
  On minimal elementary bipartite graphs. 127-138
  Electronic Edition (link) BibTeX
• Paul Erdös, Arthur M. Hobbs:
  Hamiltonian cycles in regular graphs of moderate degree. 139-142
  Electronic Edition (link) BibTeX
• Alan Tucker:
  Critical perfect graphs and perfect 3-chromatic graphs. 143-149
  Electronic Edition (link) BibTeX

Volume 23, Numbers 2-3, October - December 1977

• Ming-Huat Lim:
  A product of matroids and its automorphism group. 151-163
  Electronic Edition (link) BibTeX
• James W. Uebelacker:
  Product graphs for given subgroups of the wreath product of two groups, II. 164-167
  Electronic Edition (link) BibTeX
• Maria Overbeck-Larisch:
  A theorem on pancyclic-oriented graphs. 168-173
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Bert Hartnell:
  Edge partitions of complete multipartite graphs into equal length circuits. 174-183
  Electronic Edition (link) BibTeX
• J. W. Moon, M. Sobel:
  Enumerating a class of nested group testing procedures. 184-188
  Electronic Edition (link) BibTeX
• Paul D. Seymour:
  The matroids with the max-flow min-cut property. 189-222
  Electronic Edition (link) BibTeX
• Thomas A. Dowling:
  Complementing permutations in finite lattices. 223-226
  Electronic Edition (link) BibTeX
• Martin Milgram, Peter Ungar:
  Bounds for the genus of graphs with given Betti number. 227-233
  Electronic Edition (link) BibTeX
• Frans C. Bussemaker, S. Cobeljic, D. M. Cvetkovic, J. J. Seidel:
  Cubic graphs on <=14 vertices. 234-235
  Electronic Edition (link) BibTeX
• Joseph A. Thas:
  Two infinite classes of perfect codes in metrically regular graphs. 236-238
  Electronic Edition (link) BibTeX
• Shunichi Toida:
  A note on Ádám's conjecture. 239-246
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Alexandr V. Kostochka:
  On an upper bound of a graph's chromatic number, depending on the graph's degree and density. 247-250
  Electronic Edition (link) BibTeX
• D. T. Busolini, Paul Erdös:
  On a problem in extremal graph theory. 251-254
  Electronic Edition (link) BibTeX
• Paul Erdös, Robin J. Wilson:
  On the chromatic index of almost all graphs. 255-257
  Electronic Edition (link) BibTeX
• Robert James Douglas:
  The maximum number of K_j-subgraphs in a graph with k independent edges. 258-261
  Electronic Edition (link) BibTeX
• P. J. Lorimer, P. R. Mullins:
  Ramsey numbers for quadrangles and triangles. 262-265
  Electronic Edition (link) BibTeX