The Australasian Journal of Combinatorics

Volume 23 (2001)

• S. Akbari, H.R. Maimani and Ch. Maysoori
  • Minimal defining sets for full 2-$(v,3,v-2)$ designs, pp.5–8

  ---

• I.M. Wanless
  • Path achievement games, pp.9–18

  ---

• Yan-Ling Shao and Yu-Bin Gao
  • The $k$th upper generalized exponent set for primitive matrices, pp.19–26

  ---

• D. Combe and D.E. Taylor
  • Two results concerning distance-regular directed graphs, pp.27–36

  ---

• Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou and Akira Saito
  • Vertex-disjoint cycles containing specified edges in a bipartite graph, pp.37–48

  ---

• Roderick J. Fletcher and Jennifer Seberry
  • New $D$-optimal designs of order 110, pp.49–52

  ---

• N.C.K. Phillips, W.D. Wallis and Rolf S. Rees
  • Packings and coverings of $v=3m+1$ points with near-triangle factors, pp.53–70

  ---

• Beiliang Du
  • The existence of bimatching designs, pp.71–74

  ---

• Roderick J. Fletcher, Marc Gysin and Jennifer Seberry
  • Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices, pp.75–86

  ---

• Peter Adams and Darryn E. Bryant
  • The $\mu$-way intersection problem for cubes, pp.87–100

  ---

• Michael A. Henning and Ortrud R. Oellermann
  • The average connectivity of regular multipartite tournaments, pp.101–113

  ---

• Gregory Gutin and Anders Yeo
  • Remarks on hamiltonian digraphs, pp.115–118

  ---

• E.S. Mahmoodian and Nasrin Soltankhah
  • A linear algebraic approach to directed designs, pp.119–134

  ---

• R. Bruce Richter and Gelasio Salazar
  • The crossing number of $C_6 \times C_n$, pp.135–143

  ---

• Jing Huang and Kathryn L.B. Wood
  • Nearly-acyclically pushable tournaments, pp.145–152

  ---

• Marc Gysin and Jennifer Seberry
  • On ternary complementary pairs, pp.153–170

  ---

• Charles J. Colbourn and Alan C.H. Ling
  • $(M,S)$-optimal designs with block size three, pp.171–179

  ---

• Selma Djelloul and Mekkia Kouider
  • On weighted mean distance, pp.181–195

  ---

• Marc Gysin and Jennifer Seberry
  • On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function, pp.197–209

  ---

• Lihua You, Gexin Yu and Bolian Liu
  • On maximal $(k,b)$-linear-free sets of integers and its spectrum, pp.211–215

  ---

• M.J. Grannell, T.S. Griggs and R. Hill
  • The triangle chromatic index of Steiner triple systems, pp.217–230

  ---

• Manouchehr Zaker
  • Greedy defining sets of graphs, pp.231–235

  ---

• Frantisek Franek, Dalibor Fronček and Alexander Rosa
  • Imbalance in tournament designs, pp.237–251

  ---

• Matthew D. Kearse and Peter B. Gibbons
  • Computational methods and new results for chessboard problems, pp.253–284

  ---

• E.J. Cockayne and C.M. Mynhardt
  • Properties of Queens graphs and the irredundance number of $Q_7$, pp.285–299

  ---

• Matthew Johnson and David Bedford
  • Weak critical sets in cyclic Latin squares, pp.301–316

  ---