Volume 2 (1990)
- N. Achuthan, N.R. Achuthan and L. Caccetta
- N.R. Achuthan and M. Simanihuruk
- Brian Alspach and Katherine Heinrich
- Matching designs, pp.39–55
- Sheng Bau
- F.E. Bennett
- K. Budayasa and L. Caccetta
- On critically $k$-edge-connected graphs, pp.101–109
- Yeow Meng Chee, Charles J. Colbourn, Steven C. Furino and Donald L. Kreher
- Large sets of disjoint $t$-designs, pp.111–119
- Roger B. Eggleton, Latif A. Al-Hakim and James MacDougall
- Braced edges in plane triangulations, pp.121–133
- Bill Jackson and Nicholas C. Wormald
- $k$-walks of graphs, pp.135–146
- A. Meir and J.W. Moon
- On the maximum out-degree in random trees, pp.147–156
- Alan Rahilly
- R.G. Stanton and R.W. Buskens
- An upper approximation to the BIBD (15,21,7,5,2), pp.181–189
- Marta Sved and Robert J. Clarke
- King's walk on the infinite chessboard, pp.191–216
- Roberto Tamassia
- Drawing algorithms for planar $st$-graphs, pp.217–235
- W.D. Wallis