Journal of Combinatorial Theory, Series B, Volume 33

Volume 33, Number 3, December 1982

• Cornelis Roos, A. J. van Zanten:
  On the existence of certain distance-regular graphs. 197-212
  Electronic Edition (link) BibTeX
• Aeryung Moon:
  Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k). 213-221
  Electronic Edition (link) BibTeX
• David W. Barnette:
  Generating the triangulations of the projective plane. 222-230
  Electronic Edition (link) BibTeX
• Frank Thomson Leighton:
  Finite common coverings of graphs. 231-238
  Electronic Edition (link) BibTeX
• Paul H. Edelman:
  The lattice of convex sets of an oriented matroid. 239-244
  Electronic Edition (link) BibTeX
• Tian Feng, Zheng-Sheng Wu, Cun-Quan Zhang:
  Cycles of each length in tournaments. 245-255
  Electronic Edition (link) BibTeX
• Aeryung Moon:
  On the uniqueness of the graphs G(n, k) of the Johnson schemes. 256-264
  Electronic Edition (link) BibTeX
• Victor Neumann-Lara:
  The dichromatic number of a digraph. 265-270
  Electronic Edition (link) BibTeX
• Bill Sands, Norbert Sauer, Robert E. Woodrow:
  On monochromatic paths in edge-coloured digraphs. 271-275
  Electronic Edition (link) BibTeX
• P. Hanlon, Robert W. Robinson:
  Counting bridgeless graphs. 276-305
  Electronic Edition (link) BibTeX