Volume 152, Numbers 1-3, May 1996
: Partitions of graphs into one or two independent sets and cliques.
: Zero-sum problems - A survey.
: A combinatorial method for the enumeration of column-convex polyominoes.
: A larger class of reconstructible tournaments.
S. R. Kingan
: Binary matroids without prisms, prism duals, and cubes.
: The Chvátal-Erdös condition for cycles in triangle-free graphs.
: On the existence of k-tournaments with given automorphism group.
S. D. Noble
: Recognising a partitionable simplicial complex is in NP.
: The number of permutations containing exactly one increasing subsequence of length three.