Journal of Combinatorial Theory, Series B, Volume 36

Volume 36, Number 1, February 1984

• Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu:
  On optimal embeddings of metrics in graphs. 1-15
  Electronic Edition (link) BibTeX
• Nathan Linial:
  Graph decompositions without isolates. 16-25
  Electronic Edition (link) BibTeX
• Paul H. Edelman:
  The acyclic sets of an oriented matroid. 26-31
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, Charles Delorme, G. Farhi:
  Large graphs with given degree and diameter. II. 32-48
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. III. Planar tree-width. 49-64
  Electronic Edition (link) BibTeX
• Peter Hoffman, Bruce Richter:
  Embedding graphs in surfaces. 65-84
  Electronic Edition (link) BibTeX
• Tomio Hirata, Kiyohito Kubota, Osami Saito:
  A sufficient condition for a graph to be weakly k-linked. 85-94
  Electronic Edition (link) BibTeX
• Tiong-Seng Tay:
  Rigidity of multi-graphs. I. Linking rigid bodies in n-space. 95-112
  Electronic Edition (link) BibTeX
• Ron Aharoni:
  Matchings in graphs of size N₁. 113-117
  Electronic Edition (link) BibTeX
• Yanpei Liu:
  On the number of rooted c-nets. 118-123
  Electronic Edition (link) BibTeX

Volume 36, Number 2, April 1984

• Anthony J. W. Hilton:
  Hamiltonian decompositions of complete graphs. 125-134
  Electronic Edition (link) BibTeX
• Václav Koubek, Vojtech Rödl:
  On the minimum order of graphs with given semigroup. 135-155
  Electronic Edition (link) BibTeX
• Henry A. Kierstead:
  On the chromatic index of multigraphs without large triangles. 156-160
  Electronic Edition (link) BibTeX
• William H. Cunningham:
  Testing membership in matroid polyhedra. 161-188
  Electronic Edition (link) BibTeX
• Seiya Negami:
  Uniquely and faithfully embeddable projective-planar triangulations. 189-193
  Electronic Edition (link) BibTeX
• Albert L. Wells Jr.:
  Even signings, signed switching classes, and (-1, 1)-matrices. 194-212
  Electronic Edition (link) BibTeX
• Luis Montejano, Victor Neumann-Lara:
  A variation of Menger's theorem for long paths. 213-217
  Electronic Edition (link) BibTeX
• Han-Kun Ma:
  A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs. 218-219
  Electronic Edition (link) BibTeX

Volume 36, Number 3, June 1984

• András Frank:
  Finding feasible vectors of Edmonds-Giles polyhedra. 221-239
  Electronic Edition (link) BibTeX
• Peter M. Gibson:
  A bound for the number of tournaments with specified scores. 240-243
  Electronic Edition (link) BibTeX
• Thomas W. Tucker:
  A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs. 244-268
  Electronic Edition (link) BibTeX
• Thomas W. Tucker:
  There is one group of genus two. 269-275
  Electronic Edition (link) BibTeX
• Edward A. Bender, L. Bruce Richmond:
  The asymptotic enumeration of rooted convex polyhedra. 276-283
  Electronic Edition (link) BibTeX
• Ján Plesník:
  A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. 284-297
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Karen L. Collins:
  Duality and perfection for edges in cliques. 298-309
  Electronic Edition (link) BibTeX