Volume 75, Numbers 1-3, May 1989
: Confluence of some presentations associated with graphs.
: Simplicial decompositions of graphs: a survey of applications.
: Covering the complete graph by partitions.
: A short proof of a theorem of vámos on matroid representations.
: A simple linear expected time algorithm for finding a hamilton path.
: Dense expanders and pseudo-random bipartite graphs.