The Australasian Journal of Combinatorics

Volume 3 (1991)

• Andrew Bowler, Kathleen Quinn and Jennifer Seberry
  • Generalised Bhaskar Rao designs with elements from cyclic groups of even order, pp.5–13

  ---

• L. Caccetta and K. Vijayan
  • Minimal graphs with prescribed vertex independence and clique numbers, pp.15–30

  ---

• Peter Lorimer
  • Embeddings of symmetric graphs in surfaces, pp.31–54

  ---

• Bor-Liang Chen, Hung-Lin Fu and Kuo-Ching Huang
  • Decomposing graphs into forests of paths with size less than three, pp.55–73

  ---

• Charles J. Colbourn, Rudolf A. Mathon and Nabil Shalaby
  • The fine structure of threefold triple systems: $v\equiv5$(mod 6), pp.75–92

  ---

• Roger B. Eggleton and Latif A. Al-Hakim
  • Maximal planar graphs and diagonal operations, pp.93–110

  ---

• Martin J. Sharry and Anne Penfold Street
  • Partitioning sets of blocks into designs, pp.111–140

  ---

• Michael R. Fellows and Mark N. Hoover
  • Perfect domination, pp.141–150

  ---

• Mirka Miller
  • Digraph covering and its application to two optimization problems, pp.151–164

  ---

• D.G. Sarvate
  • Bhaskar Rao ternary designs and applications, pp.165–189

  ---

• E.S. Kramer, S.S. Magliveras and D.R. Stinson
  • Some small large sets of $t$-designs, pp.191–205

  ---

• Cheryl E. Praeger
  • On homomorphic images of edge transitive directed graphs, pp.207–210

  ---

• M. Gionfriddo, C.C. Lindner and C.A. Rodger
  • 2-colouring $K_4-e$ designs, pp.211–229

  ---

• K.T. Phelps
  • Halving block designs with block size four, pp.231–234

  ---

• Wen-Ai Jackson
  • A characterisation of $P_{n,q}$ among the symmetric designs using elations, pp.235–249

  ---