Volume 23, Number 1, August 1977

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

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

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

last updated on Sat May 25 06:24:03 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page