Journal of Combinatorial Theory, Series B, Volume 32

Volume 32, Number 1, February 1982

• Timothy R. S. Walsh:
  Counting labelled three-connected and homeomorphically irreducible two-connected graphs. 1-11
  
• Timothy R. S. Walsh:
  Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. 12-32
  
• Timothy R. S. Walsh:
  Counting non-isomorphic three-connected planar maps. 33-44
  
• Anton Kotzig, Jean M. Turgeon:
  Quasigroups defining Eulerian paths in complete graphs. 45-56
  
• Uhland Burkart:
  Interval mapping graphs and periodic points of continuous functions. 57-68
  
• Seiya Negami:
  A characterization of 3-connected graphs containing a given graph. 69-74
  
• David K. Arrowsmith, François Jaeger:
  On the enumeration of chains in regular chain-groups. 75-89
  
• Robert C. Brigham, Ronald D. Dutton:
  Generalized k-tuple colorings of cycles and other graphs. 90-94
  
• Joseph Zaks:
  Extending an extension of Grinberg's theorem. 95-98
  

Volume 32, Number 2, April 1982

• Robert L. Hemminger, Heinz Adolf Jung:
  On n-skein isomorphisms of graphs. 103-111
  
• Klaus Truemper:
  Alpha-balanced graphs and matrices and GF(3)-representability of matroids. 112-139
  
• Lowell W. Beineke, Charles H. C. Little:
  Cycles in bipartite tournaments. 140-145
  
• Chris D. Godsil, William Kocay:
  Constructing graphs with pairs of pseudo-similar vertices. 146-155
  
• Paul M. Weichsel:
  On distance-regularity in graphs. 156-161
  
• Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Graphs with certain families of spanning trees. 162-170
  
• Sóstenes Lins:
  Graph-encoded maps. 171-181
  
• Paul Terwilliger:
  The diameter of bipartite distance-regular graphs. 182-188
  
• Douglas R. Woodall:
  Vector transversals. 189-205
  
• Stephen C. Locke:
  Relative lengths of paths and cycles in k-connected graphs. 206-222
  
• Jacqueline Ayel:
  Hamiltonian cycles in particular k-partite graphs. 223-228
  

Volume 32, Number 3, June 1982

• Brad Jackson, T. D. Parsons:
  Longest cycles in r-regular r-connected graphs. 231-245
  
• Vera T. Sós, Ernst G. Straus:
  Extremals of functions on graphs with applications to graphs and hypergraphs. 246-257
  
• Thomas Andreae:
  Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. 258-263
  
• Heinz-Jürgen Voss:
  Graphs having circuits with at least two chords. 264-285
  
• Ernest J. Cockayne, A. G. Thomason:
  Ordered colourings of graphs. 286-292
  
• Norbert Polat:
  Couplages et transversaux généralisés d'un hypergraphe infini. 293-315
  
• André Bouchet:
  Constructing a covering triangulation by means of a nowhere-zero dual flow. 316-325
  
• Dominique de Werra:
  Obstructions for regular colorings. 326-335
  
• Chong-Yun Chao, Jacqueline G. Wells:
  A class of vertex-transitive digraphs, II. 336-346
  
• Jacques Aubert, Bernadette Schneider:
  Graphes orientes indécomposables en circuits hamiltoniens. 347-349
  
• Douglas R. Woodall:
  Some notes on feinberg's k-independence problem. 350-352
  
• Hong Yuan:
  An eigenvector condition for reconstructibility. 353-354