Volume 30, Number 1, February 1981
: On a generalization of linear independence in finite-dimensional vector spaces.
: Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k.
: Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members.
: Hall-conditions and the three-family problem.
Volume 30, Number 2, April 1981
John B. Kelly
: Difference systems, graph designs, and coloring problems.
: Connected graphs with a minimal number of spanning trees.
: The reconstruction of maximal planar graphs II. Reconstruction.
Volume 30, Number 3, June 1981
: A minimax theorem on circuits in projective graphs.
: The automorphism group of a product of hypergraphs.
: The non-existence of certain regular graphs of girth 5.
W. A. Denig
: A class of matroids derived from saturated chain partitions of partially ordered sets.
D. T. Busolini
: 2-Colored triangles in edge-colored complete graphs, II.