Journal of Combinatorial Theory, Series B, Volume 35

Volume 35, Number 1, August 1983

• Peter J. Cameron, Cheryl E. Praeger:
  On 2-arc transitive graphs of girth 4. 1-11
  Electronic Edition (link) BibTeX
• Tomaz Pisanski, John Shawe-Taylor, Joze Vrabec:
  Edge-colorability of graph bundles. 12-19
  Electronic Edition (link) BibTeX
• Li Weixuan:
  On matroids of the greatestW-connectivity. 20-27
  Electronic Edition (link) BibTeX
• Saul Stahl:
  A combinatorial analog of the Jordan Curve Theorem. 28-38
  Electronic Edition (link) BibTeX
• Neil Robertson, Paul D. Seymour:
  Graph minors. I. Excluding a forest. 39-61
  Electronic Edition (link) BibTeX
• Richard A. Brualdi, Li Qiao:
  Upsets in round robin tournaments. 62-77
  Electronic Edition (link) BibTeX
• B. Devadas Acharya:
  Even edge colorings of a graph. 78-79
  Electronic Edition (link) BibTeX
• J. A. Bondy:
  Erratum. 80
  Electronic Edition (link) BibTeX

Volume 35, Number 2, October 1983

• Jozef Sirán:
  Crossing-critical edges and Kuratowski subgraphs of a graph. 83-92
  Electronic Edition (link) BibTeX
• G. A. Jones, J. S. Thornton:
  Operations on maps, and outer automorphisms. 93-103
  Electronic Edition (link) BibTeX
• Alexander Schrijver:
  Packing and covering of crossing families of cuts. 104-128
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Girth in graphs. 129-141
  Electronic Edition (link) BibTeX
• Amram Meir, John W. Moon, Jan Mycielski:
  Hereditarily finite sets and identity trees. 142-155
  Electronic Edition (link) BibTeX
• Richard A. Brualdi, Rachel Manber:
  Prime interchange graphs of classes of matrices of zeros and ones. 156-170
  Electronic Edition (link) BibTeX
• James W. Walker:
  From graphs to ortholattices and equivariant maps. 171-192
  Electronic Edition (link) BibTeX
• Douglas Bauer:
  Regular K_n-free graphs. 193-200
  Electronic Edition (link) BibTeX
• Colin D. Walter:
  Intersection numbers for coherent configurations and the spectrum of a graph. 201-204
  Electronic Edition (link) BibTeX

Volume 35, Number 3, December 1983

• Robert E. Jamison:
  On the average number of nodes in a subtree of a tree. 207-223
  Electronic Edition (link) BibTeX
• Edward R. Scheinerman, Douglas B. West:
  The interval number of a planar graph: Three intervals suffice. 224-239
  Electronic Edition (link) BibTeX
• Chris D. Godsil, William Kocay:
  Graphs with three mutually pseudo-similar vertices. 240-246
  Electronic Edition (link) BibTeX
• Zhu Yong-jin, Tian Feng:
  A generalization of the Bondy-Chvátal theorem on the k-closure. 247-255
  Electronic Edition (link) BibTeX
• Andrew Vince:
  Regular combinatorial maps. 256-277
  Electronic Edition (link) BibTeX
• P. A. Deift, Carlos Tomei:
  On the determinant of the adjacency matrix for a planar sublattice. 278-289
  Electronic Edition (link) BibTeX
• Béla Bollobás, Pierre Duchet:
  On Helly families of maximal size. 290-296
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, Bill Jackson, François Jaeger:
  Shortest coverings of graphs with cycles. 297-308
  Electronic Edition (link) BibTeX
• Peter C. Fishburn:
  On the sphericity and cubicity of graphs. 309-318
  Electronic Edition (link) BibTeX
• Peter J. Slater:
  On k-graceful, locally finite graphs. 319-322
  Electronic Edition (link) BibTeX
• Vasek Chvátal, Endre Szemerédi:
  Short cycles in directed graphs. 323-327
  Electronic Edition (link) BibTeX
• Wenceslas Fernandez de la Vega:
  On the maximum cardinality of a consistent set of arcs in a random tournament. 328-332
  Electronic Edition (link) BibTeX
• A. Augusteijn, A. J. W. Duijvestijn:
  Simple perfect square-cylinders of low order. 333-337
  Electronic Edition (link) BibTeX