Volume 152, Numbers 1-3, May 1996
Andreas Brandstädt:
Partitions of graphs into one or two independent sets and cliques. 47-54
Yair Caro:
Zero-sum problems - A survey. 93-113
Virgil Domocos:
A combinatorial method for the enumeration of column-convex polyominoes. 115-123
Cosimo Guido:
A larger class of reconstructible tournaments. 171-184
S. R. Kingan:
Binary matroids without prisms, prism duals, and cubes. 211-224
Dingjun Lou:
The Chvátal-Erdös condition for cycles in triangle-free graphs. 253-257
Susan Marshall:
On the existence of k-tournaments with given automorphism group. 259-268
S. D. Noble:
Recognising a partitionable simplicial complex is in NP. 303-305
John Noonan:
The number of permutations containing exactly one increasing subsequence of length three. 307-313