Australasian Journal of Combinatorics

Contents Volume 2:

N. Achuthan, N.R. Achuthan and L. Caccetta, On the Nordhaus-Gaddum class problems, p.5

N.R. Achuthan and M. Simanihuruk, On potentially $P$-graphic degree sequences, p.29

Brian Alspach and Katherine Heinrich, Matching designs, p.39

Sheng Bau, Cycles containing a set of elements in cubic graphs, p.57

F.E. Bennett, Pairwise balanced designs with block sizes 4 and 8, p.77

K. Budayasa and L. Caccetta, On critically $k$-edge-connected graphs, p.101

Yeow Meng Chee, Charles J. Colbourn, Steven C. Furino and Donald L. Kreher, Large sets of disjoint $t$-designs, p.111

Roger B. Eggleton, Latif A. Al-Hakim and James MacDougall, Braced edges in plane triangulations, p.121

Bill Jackson and Nicholas C. Wormald, $k$-walks of graphs, p.135

A. Meir and J.W. Moon, On the maximum out-degree in random trees, p.147

Alan Rahilly, Semiregular group divisible designs whose duals are semiregular, p.157

R.G. Stanton and R.W. Buskens, An upper approximation to the BIBD (15,21,7,5,2), p.181

Marta Sved and Robert J. Clarke, King's walk on the infinite chessboard, p.191

Roberto Tamassia, Drawing algorithms for planar $st$-graphs, p.217

W.D. Wallis, Not all perfect extrinsic secret sharing schemes are ideal, p.237