## Volume 23 (2001)

- S. Akbari, H.R. Maimani and Ch. Maysoori
- I.M. Wanless
- Path achievement games, pp.9–18

- Yan-Ling Shao and Yu-Bin Gao
- D. Combe and D.E. Taylor
- Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou and Akira Saito
- 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
- Beiliang Du
- The existence of bimatching designs, pp.71–74

- Roderick J. Fletcher, Marc Gysin and Jennifer Seberry
- Peter Adams and Darryn E. Bryant
- The $\mu$-way intersection problem for cubes, pp.87–100

- Michael A. Henning and Ortrud R. Oellermann
- 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
- Lihua You, Gexin Yu and Bolian Liu
- M.J. Grannell, T.S. Griggs and R. Hill
- 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
- E.J. Cockayne and C.M. Mynhardt
- Matthew Johnson and David Bedford
- Weak critical sets in cyclic Latin squares, pp.301–316