The Australasian Journal of Combinatorics

Volume 1 (1990)

• L. Caccetta and S. Mardiyono
  • On maximal sets of one-factors, pp.5–14

  ---

• L. Caccetta and Purwanto
  • Deficiencies and vertex clique covering numbers of a family of trees, pp.15–27

  ---

• D. Chen and D.R. Stinson
  • Recent results on combinatorial constructions for threshold schemes, pp.29–48

  ---

• R.J. Clarke
  • A note on the cycle index polynomial of the symmetric group, pp.49–51

  ---

• E. Dawson, J. Asenstorfer and P. Gray
  • Cryptographic properties of Groth sequences, pp.53–65

  ---

• Warwick de Launey
  • On the construction of $n$-dimensional designs from 2-dimensional designs, pp.67–81

  ---

• Diane Donovan
  • The centre of a sloop, pp.83–89

  ---

• Ken Gray
  • Further results on smallest defining sets of well known designs, pp.91–100

  ---

• C.C. Lindner
  • How to construct a block design with block size four admitting a blocking set, pp.101–125

  ---

• Paul Moore and Rolf Rees
  • On the number of connecting lines determined by $n$ points in the real plane, pp.127–147

  ---

• Christine M. O'Keefe
  • Ovals in Desarguesian planes, pp.149–159

  ---

• William D. Palmer
  • Generalized Bhaskar Rao designs with two association classes, pp.161–180

  ---

• Sandra J. Pattison and Deborah J. Street
  • Small non-isomorphic repeated measurements designs, pp.181–192

  ---

• Cheryl E. Praeger
  • Block-transitive designs and maximal subgroups of finite symmetric groups, pp.193–205

  ---

• R.G. Stanton and R.W. Buskens
  • Excess graphs and bicoverings, pp.207–210

  ---

• Marta Sved
  • Fractals, recursions, divisibility, pp.211–232

  ---

• W.D. Wallis and Julin Wu
  • Generalized clique coverings of chordal graphs, pp.233–236

  ---

• Xiaoji Wang
  • New results on the costs of Huffman trees, pp.237–243

  ---