Journal of Combinatorial Theory, Series B, Volume 28

Volume 28, Number 1, February 1980

• V. A. Aksionov, Leonid S. Melnikov:
  Some counterexamples associated with the three-color problem. 1-9
  Electronic Edition (link) BibTeX
• F. W. Clarke, A. D. Thomas, D. A. Waller:
  Embeddings of covering projections of graphs. 10-17
  Electronic Edition (link) BibTeX
• Stephane Foldes:
  Symmetries of directed graphs and the Chinese remainder theorem. 18-25
  Electronic Edition (link) BibTeX
• Ulrich Faigle:
  Geometries on partially ordered sets. 26-51
  Electronic Edition (link) BibTeX
• S. Beraha, J. Kahane, N. J. Weiss:
  Limits of chromatic zeros of some families of maps. 52-65
  Electronic Edition (link) BibTeX
• Jack E. Graver, W. B. Jurkat:
  f-Factors and related decompositions of graphs. 66-84
  Electronic Edition (link) BibTeX
• Daniel J. Kleitman, D. J. Kwiatkowski:
  Further results on the Aanderaa-Rosenberg conjecture. 85-95
  Electronic Edition (link) BibTeX
• Charles R. Johnson, Morris Newman:
  A note on cospectral graphs. 96-103
  Electronic Edition (link) BibTeX

Volume 28, Number 2, April 1980

• W. T. Tutte:
  On the enumeration of convex polyhedra. 105-126
  Electronic Edition (link) BibTeX
• Ioan Tomescu:
  Some properties of irreducible coverings by cliques of complete multipartite graphs. 127-141
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Hamiltonian-connected tournaments. 142-163
  Electronic Edition (link) BibTeX
• Rudolf Ahlswede:
  Simple hypergraphs with maximal number of adjacent pairs of edges. 164-167
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  6-Transitive graphs. 168-179
  Electronic Edition (link) BibTeX
• Y. Alavi, M. Behzad, E. A. Nordhaus:
  Minimal separating sets of maximum size. 180-183
  Electronic Edition (link) BibTeX
• Victor Klee:
  Classification and enumeration of minimum (d, 3, 3)-graphs for odd d. 184-207
  Electronic Edition (link) BibTeX
• László Lovász:
  Matroid matching and some applications. 208-236
  Electronic Edition (link) BibTeX
• Paul D. Seymour:
  Packing and covering with matroid circuits. 237-242
  Electronic Edition (link) BibTeX
• William G. Frye, Renu Laskar:
  Path number of bipartite digraphs. 243-244
  Electronic Edition (link) BibTeX
• Rainer E. Burkard, Peter L. Hammer:
  A note on Hamiltonian split graphs. 245-248
  Electronic Edition (link) BibTeX
• James G. Oxley:
  On Hartfiel and Maxson's definition of connected sets of a matroid. 249-250
  Electronic Edition (link) BibTeX

Volume 28, Number 3, June 1980

• András Frank:
  On the orientation of graphs. 251-261
  Electronic Edition (link) BibTeX
• P. J. Owens:
  On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks. 262-277
  Electronic Edition (link) BibTeX
• László Babai, Ales Pultr:
  Endomorphism monoids and topological subgraphs of graphs. 278-283
  Electronic Edition (link) BibTeX
• George J. Minty:
  On maximal independent sets of vertices in claw-free graphs. 284-304
  Electronic Edition (link) BibTeX
• Paul D. Seymour:
  Decomposition of regular matroids. 305-359
  Electronic Edition (link) BibTeX